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 an identity for the cycle indices of rooted tree automorphism groups.”
Almost all trees have an even number of independent sets.
From paths to stars.
Alameddine, A.F. (1991)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Exponential generating functions for trees with weighted edges and labeled nodes.
Woan, Wen-jin, Tankersley, Barbara (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Some remarks on the enumeration of rooted trees
Z. A. Łomnicki (1973)
Applicationes Mathematicae
Similarity:
A combinatorial derivation of the number of labeled forests.
Callan, David (2003)
Journal of Integer Sequences [electronic only]
Similarity:
On Catalan trees and the Jacobian conjecture.
Singer, Dan (2001)
The Electronic Journal of Combinatorics [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:
Determination of Large Families and Diameter of Equiseparable Trees
Zoran Stanić (2006)
Publications de l'Institut Mathématique
Similarity:
On Cayley's enumeration of alkanes (or 4-valent trees).
Rains, E.M., Sloane, N.J.A. (1999)
Journal of Integer Sequences [electronic only]
Similarity:
On the rules for the elimination of the non-canonical Morgan trees
Damir Vukičević (2009)
Kragujevac Journal of Mathematics
Similarity:
On A-Trees
Đuro Kurepa (1968)
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,...