✦ LIBER ✦

A new technique for the characterization of graphs with a maximum number of spanning trees

✍ Scribed by L. Petingi; J. Rodriguez

Book ID: 108315634
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 203 KB
Volume: 244
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00095-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the characterization of graphs with m

On the characterization of graphs with maximum number of spanning trees

✍ L. Petingi; F. Boesch; C. Suffel 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 591 KB

A graph G with n nodes and e edges is said to be t-optimal if G has the maximum number of spanning trees among all graphs with the same number of nodes and edges as G. Hitherto, t-optimal graphs have been characterized for the following cases: (a) n=sp, and e=(s(s-1)/2)p 2, when s and p are positive

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

Connected graphs with a minimal number o

Connected graphs with a minimal number of spanning trees

✍ N Gaffke 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 743 KB

Graphs with an extremal number of spanni

Graphs with an extremal number of spanning trees

✍ A. K. Kelmans 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 1 views

The number of spanning trees of a graph

✍ Jianxi Li; Wai Chee Shiu; An Chang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 387 KB

In this paper, we present some sharp upper bounds for the number of spanning trees of a connected graph in terms of its structural parameters such as the number of vertices, the number of edges, maximum vertex degree, minimum vertex degree, connectivity and chromatic number.