Enumeration of connected invariant graphs

DOI10.1016/0095-8956(83)90040-0MaRDI QIDQ788743zbMATH OpenOpenAlexFDO

Authors Edward A. Bender, E. Rodney Canfield

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

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

Recommendations

• An algebraic representation of graphs and applications to graph enumeration
• An invariant theory approach to graph enumeration
• The number of labeled 2-connected planar graphs
• The enumeration of labeled graphs by number of cutpoints
• Enumeration of labeled connected graphs with given order and size

Cites work

• scientific article; zbMATH DE number 3877223 (Why is no real title available?)
• scientific article; zbMATH DE number 3722678 (Why is no real title available?)
• scientific article; zbMATH DE number 3623600 (Why is no real title available?)
• scientific article; zbMATH DE number 3336708 (Why is no real title available?)
• scientific article; zbMATH DE number 3340122 (Why is no real title available?)
• scientific article; zbMATH DE number 3344587 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• A Relationship between Two Sequences Iii
• An Asymptotic Expansion for the Coefficients of Some Formal Power Series
• Asymptotic Relations Between Enumerative Functions in Graph Theory
• Asymptotic formulas for the number of oriented graphs
• Color patterns that are invariant under a given permutation of the colors
• Enumeration of graphs with signed points and lines
• Enumeration of self‐converse digraphs
• Isographs and oriented isographs
• Mixed self-complementary and self-converse digraphs
• The enumeration of bipartite graphs

Cited in

(10)

• Enumeration of connected graph coverings
• A new formula for the generating function of the numbers of simple graphs
• Enumeration of I-graphs: Burnside does it again
• scientific article; zbMATH DE number 1868509 (Why is no real title available?)
• An algebraic representation of graphs and applications to graph enumeration
• An invariant theory approach to graph enumeration
• The number of labeled connected graphs modulo prime powers
• Enumeration of labeled, connected, homeomorphically irreducible graphs
• scientific article; zbMATH DE number 1522333 (Why is no real title available?)
• scientific article; zbMATH DE number 4152411 (Why is no real title available?)

This page was built for publication: Enumeration of connected invariant graphs

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