On the Number of Self-Complementary Graphs and Digraphs

DOI10.1112/jlms/s1-38.1.99zbMath0116.15001OpenAlexW2051010080MaRDI QIDQ5725268

Ronald C. Read

Publication date: 1963

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s1-38.1.99

zbMATH Keywords

topology

Related Items (22)

Unnamed Item ⋮ The cyclic sieving phenomenon ⋮ Asymptotic formulas for the number of self‐complementary graphs and digraphs ⋮ Clique-Width for Graph Classes Closed under Complementation ⋮ Unnamed Item ⋮ A class of vertex-transitive digraphs. II ⋮ Enumeration of hypergraphs ⋮ Enumeration of bipartite self-complementary graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On switching classes of graphs ⋮ All self-complementary symmetric graphs ⋮ Sylow subgraphs in self-complementary vertex transitive graphs ⋮ Mixed self-complementary and self-converse digraphs ⋮ Enumeration of self-complementary structures ⋮ Unnamed Item ⋮ Self-complementary graphs ⋮ Isographs and oriented isographs ⋮ On the number of \(n\)-plexes ⋮ The enumeration of self-complementary \(k\)-multigraphs ⋮ On the enumeration of self-complementary m-placed relations ⋮ Enumeration of self‐converse digraphs

This page was built for publication: On the Number of Self-Complementary Graphs and Digraphs