Enumeration of labelled (k,m)-trees

Authors
Pikhurko, O
Citation
O. Pikhurko, Enumeration of labelled (k,m)-trees, J COMB TH A, 86(1), 1999, pp. 197-199
Citations number
11
Categorie Soggetti
Mathematics
Journal title
JOURNAL OF COMBINATORIAL THEORY SERIES A
ISSN journal
00973165 → ACNP
Volume
86
Issue
1
Year of publication
1999
Pages
197 - 199
Database
ISI
SICI code
0097-3165(199904)86:1<197:EOL(>2.0.ZU;2-F
Abstract
A k-graph is called a (k, m)-tree if it can be obtained from a single edge by consecutively adding edges so that every new edge contains K-m new verti ces while its remaining m vertices are covered by an already existing edge. We prove that there are [GRAPHICS] distinct vertex labelled (k, m)-trees with e edges. (C) 1999 Academic Press .