Weighted spanning trees on some self-similar graphs.

D'Angeli, Daniele; Donno, Alfredo

Displaying similar documents to “Weighted spanning trees on some self-similar graphs.”

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:

The number of labelled $k$ -arch graphs.

Lamathe, Cédric (2004)

Journal of Integer Sequences [electronic only]

Similarity:

The block connectivity of random trees.

McGrae, Andrew R.A., Zito, Michele (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Note: Sharp Upper and Lower Bounds on the Number of Spanning Trees in Cartesian Product of Graphs

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 [...] .