Some remarks on the enumeration of rooted trees
Z. A. Łomnicki (1973)
Applicationes Mathematicae
Similarity:
Displaying similar documents to “Exponential generating functions for trees with weighted edges and labeled nodes.”
Some remarks on the enumeration of rooted trees
A combinatorial derivation of the number of labeled forests.
Callan, David (2003)
Journal of Integer Sequences [electronic only]
Similarity:
Deducing Properties of Trees From Their Matula Numbers
Ivan Gutman, Yeong-Nan Yeh (1993)
Publications de l'Institut Mathématique
Similarity:
On Catalan trees and the Jacobian conjecture.
Singer, Dan (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Almost all trees have an even number of independent sets.
Wagner, Stephan G. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On A-Trees
Đuro Kurepa (1968)
Publications de l'Institut Mathématique
Similarity:
On the normal disconnection of a tree
A. Kośliński (1987)
Applicationes Mathematicae
Similarity:
On the structure of path-like trees
F.A. Muntaner-Batle, Miquel Rius-Font (2008)
Discussiones Mathematicae Graph Theory
Similarity:
We study the structure of path-like trees. In order to do this, we introduce a set of trees that we call expandable trees. In this paper we also generalize the concept of path-like trees and we call such generalization generalized path-like trees. As in the case of path-like trees, generalized path-like trees, have very nice labeling properties.
On the distribution of depths in increasing trees.
Kuba, Markus, Wagner, Stephan (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Probabilistic proofs of hook length formulas involving trees.
Sagan, Bruce E. (2009)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
-trees and normalization of pseudogroups.
Rimlinger, Frank (1992)
Experimental Mathematics
Similarity:
On some hypotheses concerning trees.
D. Kurepa (1977)
Publications de l'Institut Mathématique [Elektronische Ressource]
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...