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.
Description
Spectral criterion for cycle balance in networks - Acharya - 1980 - Journal of Graph Theory - Wiley Online Library
%0 Journal Article
%1 acharya80
%A Acharya, B. Devadas
%D 1980
%I Wiley Subscription Services, Inc., A Wiley Company
%J Journal of Graph Theory
%K eigenvalues graph.theory matrix signed.adjacency.matrix signed.graph
%N 1
%P 1--11
%R 10.1002/jgt.3190040102
%T Spectral criterion for cycle balance in networks
%V 4
%X 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.
@article{acharya80,
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.},
added-at = {2016-12-03T11:11:44.000+0100},
author = {Acharya, B. Devadas},
biburl = {https://www.bibsonomy.org/bibtex/27f7e641a09f37b6c5d99862ca0078ead/ytyoun},
description = {Spectral criterion for cycle balance in networks - Acharya - 1980 - Journal of Graph Theory - Wiley Online Library},
doi = {10.1002/jgt.3190040102},
interhash = {dd5fb21b4c79ebd5817d7b2378450dc0},
intrahash = {7f7e641a09f37b6c5d99862ca0078ead},
issn = {1097-0118},
journal = {Journal of Graph Theory},
keywords = {eigenvalues graph.theory matrix signed.adjacency.matrix signed.graph},
number = 1,
pages = {1--11},
publisher = {Wiley Subscription Services, Inc., A Wiley Company},
timestamp = {2017-11-22T02:32:20.000+0100},
title = {Spectral criterion for cycle balance in networks},
volume = 4,
year = 1980
}