An algebraic representation of graphs and applications to graph enumeration

DOI10.1155/2013/347613zbMath1267.05179OpenAlexW2072100297WikidataQ58923540 ScholiaQ58923540MaRDI QIDQ1953661

Ângela Mestre

Publication date: 10 June 2013

Published in: International Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/347613

zbMATH Keywords

recursion formulabiconnected componentsCayley's formulaAbel's binomial theoremDziobek's inductionequivalence classes of connected graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Noncommutative geometry. Abstracts from the workshop held September 2--8, 2007.
• Quantum field theory techniques in graphical enumeration
• A multiplication rule for the descent algebra of type \(D\)
• Enumerative problems inspired by Mayer's theory of cluster integrals
• A rigidity theorem for pre-Lie algebras
• Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
• Generating connected and 2-edge connected graphs
• Combinatorics of n-point functions via Hopf algebra in quantum field theory
• Generating loop graphs via Hopf algebra in quantum field theory
• Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
• Combinatorics of 1-particle irreducible n-point functions via coalgebra in quantum field theory
• Depth-First Search and Linear Graph Algorithms
• Menger's theorem for infinite graphs with ends

This page was built for publication: An algebraic representation of graphs and applications to graph enumeration