Almost all trees have an even number of independent sets.
Wagner, Stephan G. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “On the number of independent sets in a tree.”
Almost all trees have an even number of independent sets.
On Catalan trees and the Jacobian conjecture.
Singer, Dan (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
From paths to stars.
Alameddine, A.F. (1991)
International Journal of Mathematics and Mathematical Sciences
Similarity:
On the rules for the elimination of the non-canonical Morgan trees
Damir Vukičević (2009)
Kragujevac Journal of Mathematics
Similarity:
Determination of Large Families and Diameter of Equiseparable Trees
Zoran Stanić (2006)
Publications de l'Institut Mathématique
Similarity:
A combinatorial derivation of the number of labeled forests.
Callan, David (2003)
Journal of Integer Sequences [electronic only]
Similarity:
Noncrossing trees and noncrossing graphs.
Chen, William Y.C., Yan, Sherry H.F. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Small integral trees.
Brouwer, A.E. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Balanced integral trees
Pavol Híc, Roman Nedela (1998)
Mathematica Slovaca
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,...
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.