✦ LIBER ✦

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

✍ Scribed by Kinkar Ch. Das

Publisher: Springer Japan
Year: 2007
Tongue: English
Weight: 85 KB
Volume: 23
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-007-0758-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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.

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.

An upper bound for the path number of a

An upper bound for the path number of a graph

✍ Alan Donald 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 529 KB

## Abstract The path number of a graph __G__, denoted __p(G)__, is the minimum number of edge‐disjoint paths covering the edges of __G.__ Lovász has proved that if __G__ has __u__ odd vertices and __g__ even vertices, then __p(G)__ ≤ 1/2 __u__ + __g__ ‐ 1 ≤ __n__ ‐ 1, where __n__ is the total numbe

A sharp edge bound on the interval numbe

A sharp edge bound on the interval number of a graph

✍ Balogh, J�zsef; Pluh�r, Andr�s 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB 👁 2 views

The interval number of a graph G, denoted by i(G), is the least natural number t such that G is the intersection graph of sets, each of which is the union of at most t intervals. Here we settle a conjecture of Griggs and West about bounding i(G) in terms of e, that is, the number of edges in G. Name

A sharp upper bound for the number of st

A sharp upper bound for the number of stable sets in graphs with given number of cut edges

✍ Hongbo Hua 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 648 KB

Let G be a connected and simple graph, and let i(G) denote the number of stable sets in G. In this letter, we have presented a sharp upper bound for the i(G)-value among the set of graphs with k cut edges for all possible values of k, and characterized the corresponding extremal graphs as well.