Some remarks on the enumeration of rooted trees
Z. A. Łomnicki (1973)
Applicationes Mathematicae
Similarity:
Z. A. Łomnicki (1973)
Applicationes Mathematicae
Similarity:
Damir Vukičević (2009)
Kragujevac Journal of Mathematics
Similarity:
Prodinger, Helmut (1996)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Đuro Kurepa (1968)
Publications de l'Institut Mathématique
Similarity:
Rimlinger, Frank (1992)
Experimental Mathematics
Similarity:
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...
Ivan Gutman, Yeong-Nan Yeh (1993)
Publications de l'Institut Mathématique
Similarity:
D. Kurepa (1977)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
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,...
Kuba, Markus (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A. Kośliński (1987)
Applicationes Mathematicae
Similarity:
Wagner, Stephan G. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity: