OFFSET
0,3
COMMENTS
a(n) is the number of unlabeled and unrooted distance-hereditary graphs on n vertices; the enumeration is obtained from the symbolic specification / generating functions through Maple's combstruct library--an arbitrary number of terms can be derived.
Enumeration also exists in various other configurations of unlabeled/labeled, unrooted/rooted, etc.
LINKS
C. Chauve, É. Fusy and J. Lumbroso, An Exact Enumeration of Distance-Hereditary Graphs, arXiv:1608.01464 [math.CO], Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium On Discrete Algorithms, ANALCO session. SIAM (2017).
A. Iriza, Enumeration and random generation of unlabeled classes of graphs: A practical study of cycle pointing and the dissymmetry theorem, arXiv:1511.06037 [cs.DM], Master's Thesis, Princeton University (2015).
Graph Classes, 3-leaf power.
Wikipedia, Leaf power.
Wikipedia, Distance-hereditary graph.
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Jérémie Lumbroso, Nov 02 2016
STATUS
approved