Counting balanced signed graphs using marked graphs

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 char...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the Edinburgh Mathematical Society 1981-06, Vol.24 (2), p.99-104
Main Authors: Harary, Frank, Kabell, Jerald A.
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0013-0915
1464-3839
DOI:10.1017/S0013091500006398