Counting balanced signed graphs using marked graphs
- 1 June 1981
- journal article
- research article
- Published by Cambridge University Press (CUP) in Proceedings of the Edinburgh Mathematical Society
- Vol. 24 (2) , 99-104
- https://doi.org/10.1017/s0013091500006398
Abstract
A graph in which each line is designated as either positive or negative is called a signed graph S. The sign of a cycle in S is a product of the signs of its lines. A signed graph in which every cycle is positive is called balanced. This concept was introduced by Harary in (3) and the following characterisation of balanced signed graphs was given.Keywords
This publication has 7 references indexed in Scilit:
- Consistent graphs with signed pointsDecisions in Economics and Finance, 1978
- Enumeration of graphs with signed points and linesJournal of Graph Theory, 1977
- On the number of balanced signed graphsBulletin of Mathematical Biology, 1967
- Structural balance: a generalization of Heider's theory.Psychological Review, 1956
- The Number of Linear, Directed, Rooted, and Connected GraphsTransactions of the American Mathematical Society, 1955
- The number of linear, directed, rooted, and connected graphsTransactions of the American Mathematical Society, 1955
- On the notion of balance of a signed graph.The Michigan Mathematical Journal, 1953