The number of labelled -arch graphs.
Lamathe, Cédric (2004)
Journal of Integer Sequences [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A note on reconstructing of finite trees from small subtrees”
The number of labelled -arch graphs.
The number of isomorphism classes of spanning trees of a graph
Bohdan Zelinka (1978)
Mathematica Slovaca
Similarity:
Distances between rooted trees
Bohdan Zelinka (1991)
Mathematica Bohemica
Similarity:
Two types of a distance between isomorphism classes of graphs are adapted for rooted trees.
Counting two-graphs related to trees.
Cameron, Peter J. (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the rules for the elimination of the non-canonical Morgan trees
Damir Vukičević (2009)
Kragujevac Journal of Mathematics
Similarity: