On the number of balanced signed graphs

DOI10.1007/BF02476926zbMATH Open0161.20904OpenAlexW2001760682WikidataQ53024735 ScholiaQ53024735MaRDI QIDQ5543329FDOQ5543329

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

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

Cited In (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

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)