✦ LIBER ✦

The number of spanning trees of a graph

✍ Scribed by Kinkar C Das,Ahmet S Cevik,Ismail N Cangul

Book ID: 121618794
Publisher: Hindawi Publishing Corporation
Year: 2013
Tongue: English
Weight: 207 KB
Volume: 2013
Category: Article
ISSN: 1025-5834
DOI: 10.1186/1029-242X-2013-395

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

✍ 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.

An upper bound for the number of spannin

An upper bound for the number of spanning trees of a graph

✍ G.R. Grimmett 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 70 KB

A Sharp Upper Bound for the Number of Sp

A Sharp Upper Bound for the Number of Spanning Trees of a Graph

✍ Kinkar Ch. Das 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 85 KB

On the number of spanning trees in a mol

On the number of spanning trees in a molecular graph

✍ R.B. Mallion 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 444 KB

A rccenl theorem due to W'aller is applied to the mokculnr gmph of a typical conjugtcd system (naphthalene) in order to demonstrate the enumeration of spanning trees, on each of which a "ring current" calculation may be based.

On the spanning tree packing number of a

On the spanning tree packing number of a graph: a survey

✍ E.M. Palmer 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 79 KB

On numbers of vertices of maximum degree

On numbers of vertices of maximum degree in the spanning trees of a graph

✍ Jerzy Topp; Preben D. Vestergaard 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 611 KB

For a connected graph G, let ~-(G) be the set of all spanning trees of G and let nd(G) be the number of vertices of maximum degree in G. In this paper we show that if G is a cactus or a connected graph with p vertices and p+ 1 edges, then the set {na(T) : T C ~-(G)) has at most one gap, that is, it