On the number of balanced signed graphs

DOI10.1007/BF02476926MaRDI QIDQ5543329zbMATH OpenOpenAlexWikidataFDO

Authors Frank Harary, Edgar M. Palmer

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

Cites work

• scientific article; zbMATH DE number 3155303 (Why is no real title available?)
• scientific article; zbMATH DE number 3226832 (Why is no real title available?)
• scientific article; zbMATH DE number 3257166 (Why is no real title available?)
• A graph theoretic approach to similarity relations
• A note on 'pattern variants on a square field'
• Enumeration of Bicolourable Graphs
• Enumeration of colored graphs
• Enumeration of paths in digraphs
• Enumeration of self‐converse digraphs
• On the coloring of signed graphs
• On the determination of redundancies in sociometric chains
• On the notion of balance of a signed graph
• On the number of bi-colored graphs
• THE POWER GROUP OF TWO PERMUTATION GROUPS
• The Number of Linear, Directed, Rooted, and Connected Graphs
• The number of paths and cycles in a digraph
• The power group enumeration theorem

Cited in

(3)

• Counting balanced signed graphs using marked graphs
• Can everybody sit closer to their friends than their enemies?
• A method of enumeration of negative cycles of a signed graph

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

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