Counting balanced signed graphs using marked graphs

DOI10.1017/S0013091500006398zbMath0476.05043OpenAlexW2039976193MaRDI QIDQ3933004

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

signed graphmarked graph

Mathematics Subject Classification ID

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

Related Items (12)

Unnamed Item ⋮ Characterizations of consistent marked graphs ⋮ On balance and consistency preserving 2-path signed graphs ⋮ Corona product of signed graphs and its application to modeling signed networks ⋮ 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 ⋮ Connected graphs switching equivalent to their iterated line graphs ⋮ A simple algorithm to detect balance in signed graphs ⋮ A remark on eigen values of signed graph ⋮ Characterization of signed graphs whose iterated signed line graphs are balanced or \(S\)-consistent ⋮ On the problem of consistent marking of a graph ⋮ Restructured class of estimators for population mean using an auxiliary variable under simple random sampling scheme ⋮ Can Everybody Sit Closer to Their Friends Than Their Enemies?

Cites Work

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

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