Enumeration of connected invariant graphs

DOI10.1016/0095-8956(83)90040-0zbMath0532.05036OpenAlexW1995108233MaRDI QIDQ788743

E. Rodney Canfield, Edward A. Bender

Publication date: 1983

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(83)90040-0

zbMATH Keywords

generating functionsasymptotic number of disconnected graphsedge reversalpermutation of colors

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The enumeration of bipartite graphs
• Mixed self-complementary and self-converse digraphs
• Isographs and oriented isographs
• An Asymptotic Expansion for the Coefficients of Some Formal Power Series
• Enumeration of graphs with signed points and lines
• Enumeration of self‐converse digraphs
• Color patterns that are invariant under a given permutation of the colors
• A Relationship between Two Sequences Iii
• Asymptotic Relations Between Enumerative Functions in Graph Theory
• Asymptotic formulas for the number of oriented graphs