Closed-form expressions for path matrices of length up to four are derived, and a novel indicator of the structural propensity of the graph to form clusters is proposed.
Abstract
Complex systems of interacting components often can be modeled by a graph that consists of a set of n nodes and a set of m edges. Such a graph can be represented by an adjacency matrix A∈Rn×n, whose (ij)th entry is one if there is an edge pointing from node i to node j, and is zero otherwise. The matrix A and its low-order powers reveal important properties of the graph and allow the enumeration of short paths and cycles that are important for determining short-range communication in the graph as well as node clustering. Closed-form expressions for path matrices of length up to four are derived, and a novel indicator of the structural propensity of the graph to form clusters is proposed. Numerical examples illustrate our analysis.
Katz centrality is a well-established measure to identify and rank the most important nodes in complex networks by means of a linear system solve. Recent works have developed notions of Katz centrality for temporal, i.e., time-evolving networks. Their drawback is that small changes in the network structure may drastica...
Kai Bergermann, Francesco Gravili, V. Simoncini et al.· 0 citations
Threshold graphs are graphs whose node set can be partitioned into a clique and an independent set, with the additional property that for each pair of nodes, one’s neighborhood is a subset of the other’s neighborhood. Threshold graphs have been well-studied in graph theory, but not much is known about multigraphs that...
Kayla Wager, John T. Saccoman· Congressus Numerantium· 0 citations
The results support HON as a simple low-degree construction for structured inter-group communication, whereas higher-radix, adaptive, or more richly connected fabrics remain better suited to less structured traffic and larger bandwidth demand.
Han Ni Soe, Yao Zhang, Zhi-Peng Xu· Parallel Processing Letters· 0 citations
This work establishes general properties of k -total bondage and finds exact values for certain graph classes including paths, cycles, wheels, complete and complete bipartite graphs.
Network theory has great significance in the assessment of complex systems in various domains such as computer science, biology, social sciences, and communication systems. This research paper provides a detailed discussion of network theory through the application of graph theory methods to assess networks and analyse...
D. M· Recent Research Reviews Jour...· 0 citations
An independent set of a graph G is a subset of VG, no two of which are adjacent. The cardinality of a maximum independent set in a graph G is called the independence number of G, denoted by alpha(G). The essential connectivity kappa'(G) of a graph G is denoted as the minimum number of vertices of G whose removal produc...
Shuang-Lv-Ren-Jiang-Hou-Xue-Gong-Li-Ying-Jie-Deng- Ding, Dan Li, Yuan-Yuan Chen· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
