Displaying similar documents to “Completely Independent Spanning Trees in (Partial) k-Trees”

On A-Trees

Đuro Kurepa (1968)

Publications de l'Institut Mathématique

Similarity:

A characterization of (γₜ,γ₂)-trees

You Lu, Xinmin Hou, Jun-Ming Xu, Ning Li (2010)

Discussiones Mathematicae Graph Theory

Similarity:

Let γₜ(G) and γ₂(G) be the total domination number and the 2-domination number of a graph G, respectively. It has been shown that: γₜ(T) ≤ γ₂(T) for any tree T. In this paper, we provide a constructive characterization of those trees with equal total domination number and 2-domination number.

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,...