The number of 0-1-2 increasing trees as two different evaluations of the Tutte polynomial of a complete graph.
Merino, C. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Merino, C. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Lamathe, Cédric (2004)
Journal of Integer Sequences [electronic only]
Similarity:
McGrae, Andrew R.A., Zito, Michele (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jernej Azarija (2013)
Discussiones Mathematicae Graph Theory
Similarity:
Let G1 and G2 be simple graphs and let n1 = |V (G1)|, m1 = |E(G1)|, n2 = |V (G2)| and m2 = |E(G2)|. In this paper we derive sharp upper and lower bounds for the number of spanning trees τ in the Cartesian product G1 □G2 of G1 and G2. We show that: [...] and [...] . We also characterize the graphs for which equality holds. As a by-product we derive a formula for the number of spanning trees in Kn1 □Kn2 which turns out to be [...] .
Cameron, Peter J. (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gessel, Ira M., Sagan, Bruce E. (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Enkosky, Thomas (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hough, David S. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Constantine, Gregory M., Buliga, Marius G. (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Gessel, Ira M., Jayawant, Pallayi (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Balogh, József, Csaba, Béla, Pei, Martin, Samotij, Wojciech (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Brualdi, Richard A., Mellendorf, Stephen (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity: