On the rules for the elimination of the non-canonical Morgan trees
Damir Vukičević (2009)
Kragujevac Journal of Mathematics
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 Catalan trees and the Jacobian conjecture.”
On the rules for the elimination of the non-canonical Morgan trees
A combinatorial derivation of the number of labeled forests.
Callan, David (2003)
Journal of Integer Sequences [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:
Deducing Properties of Trees From Their Matula Numbers
Ivan Gutman, Yeong-Nan Yeh (1993)
Publications de l'Institut Mathématique
Similarity:
Combinatorial interpretation of generalized Stirling numbers.
Lang, Wolfdieter (2009)
Journal of Integer Sequences [electronic only]
Similarity:
Determination of Large Families and Diameter of Equiseparable Trees
Zoran Stanić (2006)
Publications de l'Institut Mathématique
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,...
Probabilistic proofs of hook length formulas involving trees.
Sagan, Bruce E. (2009)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
On the normal disconnection of a tree
A. Kośliński (1987)
Applicationes Mathematicae
Similarity:
A combinatorial proof of Postnikov's identity and a generalized enumeration of labeled trees.
Seo, Seunghyun (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Some remarks on the enumeration of rooted trees
Z. A. Łomnicki (1973)
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.
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...