Some remarks on the enumeration of rooted trees
Z. A. Łomnicki (1973)
Applicationes Mathematicae
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.
The search session has expired. Please query the service again.
Displaying similar documents to “On generating series of coloured planar trees.”
Some remarks on the enumeration of rooted trees
On A-Trees
Đuro Kurepa (1968)
Publications de l'Institut Mathématique
Similarity:
A bijection between planar constellations and some colored Lagrangian trees.
Chauve, Cedric (2003)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
On some hypotheses concerning trees.
D. Kurepa (1977)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
-trees and normalization of pseudogroups.
Rimlinger, Frank (1992)
Experimental Mathematics
Similarity:
Deducing Properties of Trees From Their Matula Numbers
Ivan Gutman, Yeong-Nan Yeh (1993)
Publications de l'Institut Mathématique
Similarity:
Exponential generating functions for trees with weighted edges and labeled nodes.
Woan, Wen-jin, Tankersley, Barbara (2007)
Journal of Integer Sequences [electronic only]
Similarity:
On the normal disconnection of a tree
A. Kośliński (1987)
Applicationes Mathematicae
Similarity:
Rigid Aronszajn Trees
Stevo Todorčević (1980)
Publications de l'Institut Mathématique
Similarity:
On Cayley's enumeration of alkanes (or 4-valent trees).
Rains, E.M., Sloane, N.J.A. (1999)
Journal of Integer Sequences [electronic only]
Similarity:
Completely Independent Spanning Trees in (Partial) k-Trees
Masayoshi Matsushita, Yota Otachi, Toru Araki (2015)
Discussiones Mathematicae Graph Theory
Similarity:
Two spanning trees T1 and T2 of a graph G are completely independent if, for any two vertices u and v, the paths from u to v in T1 and T2 are internally disjoint. For a graph G, we denote the maximum number of pairwise completely independent spanning trees by cist(G). In this paper, we consider cist(G) when G is a partial k-tree. First we show that [k/2] ≤ cist(G) ≤ k − 1 for any k-tree G. Then we show that for any p ∈ {[k/2], . . . , k − 1}, there exist infinitely many k-trees G such...
Almost all trees have an even number of independent sets.
Wagner, Stephan G. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity: