✦ LIBER ✦

Counting graphs with different numbers of spanning trees through the counting of prime partitions

✍ Scribed by Jernej Azarija

Book ID: 126354014
Publisher: Springer
Year: 2014
Tongue: English
Weight: 109 KB
Volume: 64
Category: Article
ISSN: 0011-4642
DOI: 10.1007/s10587-014-0079-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counting the spanning trees of a labelle

Counting the spanning trees of a labelled molecular-graph

✍ Gutman, I.; Mallion, R.B.; Essam, J.W. 📂 Article 📅 1983 🏛 Taylor and Francis Group 🌐 English ⚖ 957 KB

Counting spanning trees in the graphs of

Counting spanning trees in the graphs of Kleitman and Golden and a generalization

✍ R. Vohra; L. Washington 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 302 KB

A new calculation is given for the number of spanning trees in a family of labellec; graphs considered by Kleitman and Golden, and for a more general class of such graphs.

New method for counting the number of sp

New method for counting the number of spanning trees in a two-tree network

✍ Xiao, Yuzhi; Zhao, Haixing 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 731 KB

On graphs with the maximum number of spa

On graphs with the maximum number of spanning trees

✍ Alexander K. Kelmans 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 814 KB

Let 3:; denote the set of simple graphs with n vertices and m edges, t ( G ) the number of spanning trees of a graph G , and F 2 H if t(K,\E(F))?t(K,\E(H)) for every s? max{u(F), u ( H ) } . We give a complete characterization of >-maximal (maximum) graphs in 3:; subject to m 5 n . This result conta

Finding the Graph with the Maximum Numbe

Finding the Graph with the Maximum Number of Spanning Trees

✍ George Moustakides; Samuel D. Bedrosian 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 328 KB

The problem is to determine the linear graph that has the maximum number of spanning trees, where only the number of nodes N and the number of branches B are prescribed. We deal with connected graphs G(N, B) obtained by deleting D branches from a complete graph KN. Our solution is for D less than or

Counting the number of spanning trees in

Counting the number of spanning trees in a class of double fixed-step loop networks

✍ Talip Atajan; Naohisa Otsuka; Xuerong Yong 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 495 KB

A double fixed-step loop network, C p,q n , is a digraph on n vertices 0, 1, 2, . . . , n -1 and for each vertex i (0 < i ≤ n-1), there are exactly two arcs going from vertex i to vertices i+p, i + q (mod n). Let p < q < n be positive integers such that (qp) Ď n and (qp)|(k 0 np) or (qp)|n (where k