Year: 2024
Type: article
Abstract: Clustering is a strategy for discovering homogeneous clusters in heterogeneous data sets based on comparable structures or properties. The number of nodes or links that must fail for a network to be divided into two or more sub-networks is known as connectivity. In addition to being a metric of network dependability, connectivity also serves as an indicator of performance. The Euler graph can represent almost any issue involving a discrete arrangement of objects. It can be analyzed using the recent field of mathematics called graph theory. This paper discusses the properties of clustered networks like connectivity and chromaticity. Further, the structure of the antipodal graph in the clustered network has been explored.
Source: Ural mathematical journal
Authors: Sambanthan Gurunathan, Thangaraj Yogalakshmi
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4405869982