Descendants in increasing trees.
Kuba, Markus, Panholzer, Alois (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Analysis of some statistics for increasing tree families.”
Descendants in increasing trees.
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:
On the Horton-Strahler number for combinatorial tries
Markus E. Nebel (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
NP-completeness of minimal width unordered tree layout.
Marriott, Kim, Stuckey, Peter J. (2004)
Journal of Graph Algorithms and Applications
Similarity:
A new class of balanced search trees : half-balanced binary search tress
H. J. Olivié (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On a matching distance between rooted phylogenetic trees
Damian Bogdanowicz, Krzysztof Giaro (2013)
International Journal of Applied Mathematics and Computer Science
Similarity:
The Robinson-Foulds (RF) distance is the most popular method of evaluating the dissimilarity between phylogenetic trees. In this paper, we define and explore in detail properties of the Matching Cluster (MC) distance, which can be regarded as a refinement of the RF metric for rooted trees. Similarly to RF, MC operates on clusters of compared trees, but the distance evaluation is more complex. Using the graph theoretic approach based on a minimum-weight perfect matching in bipartite graphs,...
Almost all trees have an even number of independent sets.
Wagner, Stephan G. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Deducing Properties of Trees From Their Matula Numbers
Ivan Gutman, Yeong-Nan Yeh (1993)
Publications de l'Institut Mathématique
Similarity:
Some remarks on the enumeration of rooted trees
Z. A. Łomnicki (1973)
Applicationes Mathematicae
Similarity:
On the normal disconnection of a tree
A. Kośliński (1987)
Applicationes Mathematicae
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...