Enumeration of self‐converse digraphs
From MaRDI portal
Publication:5531681
DOI10.1112/S0025579300003910zbMath0152.22901MaRDI QIDQ5531681
Publication date: 1966
Published in: Mathematika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/s0025579300003910
Related Items
On the number of balanced signed graphs, Enumeration of connected invariant graphs, Mixed self-complementary and self-converse digraphs, Self-converse mixed graphs are extremely rare, The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum, Isographs and oriented isographs
Cites Work
- Unnamed Item
- Unnamed Item
- Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
- THE POWER GROUP OF TWO PERMUTATION GROUPS
- The power group enumeration theorem
- On the Number of Self-Complementary Graphs and Digraphs
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
- The Number of Linear, Directed, Rooted, and Connected Graphs