On the number of balanced signed graphs

DOI10.1007/BF02476926zbMath0161.20904OpenAlexW2001760682WikidataQ53024735 ScholiaQ53024735MaRDI QIDQ5543329

Edgar M. Palmer, Frank Harary

Publication date: 1967

Published in: The Bulletin of Mathematical Biophysics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02476926

zbMATH Keywords

topology

Related Items (3)

A method of enumeration of negative cycles of a signed graph ⋮ Can Everybody Sit Closer to Their Friends Than Their Enemies? ⋮ Counting balanced signed graphs using marked graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of bi-colored graphs
• A graph theoretic approach to similarity relations
• Enumeration of paths in digraphs
• The number of paths and cycles in a digraph
• On the coloring of signed graphs
• A note on 'pattern variants on a square field'
• On the determination of redundancies in sociometric chains
• On the notion of balance of a signed graph
• Enumeration of Bicolourable Graphs
• THE POWER GROUP OF TWO PERMUTATION GROUPS
• The power group enumeration theorem
• Enumeration of self‐converse digraphs
• Enumeration of colored graphs
• The Number of Linear, Directed, Rooted, and Connected Graphs

This page was built for publication: On the number of balanced signed graphs