Spectral criterion for cycle balance in networks

1980/03/01 by B. Devadas Acharya · 4 citations

paper · doi:10.1002/jgt.3190040102

Abstract

Abstract A network is cycle balanced if the product of the weights (nonzero real numbers) of the lines of every cycle in it is positive. In this paper, we prove that a network D is cycle balanced if and only if its adjacency matrix is isospectral with its nonnegative counterpart. Consequent to this theorem is an analogous criterion for structural balance in sigraphs (abbreviation for “signed graphs”) as also for cycle balance in signed digraphs. These criteria establish in a natural way a wide scope for cospectrality considerations in the classes of signed digraphs and sigraphs.

Cited by

• The index of tC₃^--free signed graphs
• Spectral Turán problem for K_3,3^--free signed graphs
• Inertia indices of signed graphs with given cyclomatic number and given number of pendant vertices
• The index of unbalanced signed complete graphs whose negative-edge-induced subgraph is K_2,2-minor free

Related

• On the spectral radius of unbalanced signed bipartite graphs
• Balance Maximization in Signed Networks via Edge Deletions
• Isospectral Graph Transformations, Spectral Equivalence, and Global Stability of Dynamical Networks
• Signed spectral Turań type theorems
• Structural balance in signed digraphs: considering transitivity to\n measure balance in graphs constructed by using different link signing methods