![](/images/graphics-bg.png)
An Algebraic Representation of Graphs and Applications to Graph Enumeration
Author
Source
International Journal of Combinatorics
Issue
Vol. 2013, Issue 2013 (31 Dec. 2013), pp.1-14, 14 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2013-03-04
Country of Publication
Egypt
No. of Pages
14
Main Subjects
Abstract EN
We give a recursion formula to generate all the equivalence classes of connected graphs with coefficients given by the inverses of the orders of their groups of automorphisms.
We use an algebraic graph representation to apply the result to the enumeration of connected graphs, all of whose biconnected components have the same number of vertices and edges.
The proof uses Abel’s binomial theorem and generalizes Dziobek’s induction proof of Cayley’s formula.
American Psychological Association (APA)
Mestre, Ângela. 2013. An Algebraic Representation of Graphs and Applications to Graph Enumeration. International Journal of Combinatorics،Vol. 2013, no. 2013, pp.1-14.
https://search.emarefa.net/detail/BIM-464663
Modern Language Association (MLA)
Mestre, Ângela. An Algebraic Representation of Graphs and Applications to Graph Enumeration. International Journal of Combinatorics No. 2013 (2013), pp.1-14.
https://search.emarefa.net/detail/BIM-464663
American Medical Association (AMA)
Mestre, Ângela. An Algebraic Representation of Graphs and Applications to Graph Enumeration. International Journal of Combinatorics. 2013. Vol. 2013, no. 2013, pp.1-14.
https://search.emarefa.net/detail/BIM-464663
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-464663