Spectral criterion for cycle balance in networks
Author:
- 1 March 1980
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 4 (1) , 1-11
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.Keywords
This publication has 6 references indexed in Scilit:
- Graphs and determinantsThe Mathematical Gazette, 1976
- Computing the Characteristic polynomial of a graph1974
- The characteristic polynomial of a graphJournal of Combinatorial Theory, Series B, 1972
- Cospectral Graphs and DigraphsBulletin of the London Mathematical Society, 1971
- The Determinant of the Adjacency Matrix of a GraphSIAM Review, 1962
- On the notion of balance of a signed graph.The Michigan Mathematical Journal, 1953