Counting balanced signed graphs using marked graphs

DOI10.1017/S0013091500006398MaRDI QIDQ3933004zbMATH OpenOpenAlexFDO

Authors Jerald A. Kabell, Frank Harary

Publication date 1981

Published in Proceedings of the Edinburgh Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0013091500006398

zbMATH Keywords

marked graphsigned graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph theory (05C99)

Cites work

• Consistent graphs with signed points
• Enumeration of graphs with signed points and lines
• On the notion of balance of a signed graph
• On the number of balanced signed graphs
• The Number of Linear, Directed, Rooted, and Connected Graphs

Cited in

(12)

• Connected graphs switching equivalent to their iterated line graphs
• A simple algorithm to detect balance in signed graphs
• On the problem of consistent marking of a graph
• Characterizations of consistent marked graphs
• A remark on eigen values of signed graph
• Correction to: ``Restructured class of estimators for population mean using an auxiliary variable under simple random sampling scheme. A remark on normalized Laplacian eigenvalues of signed graph
• Unitary addition Cayley signed graphs
• Can everybody sit closer to their friends than their enemies?
• Restructured class of estimators for population mean using an auxiliary variable under simple random sampling scheme
• On balance and consistency preserving 2-path signed graphs
• Corona product of signed graphs and its application to modeling signed networks
• Characterization of signed graphs whose iterated signed line graphs are balanced or S-consistent

This page was built for publication: Counting balanced signed graphs using marked graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3933004)