✦ LIBER ✦

A certain polynomial of a graph and graphs with an extremal number of trees

✍ Scribed by A.K Kelmans; V.M Chelnokov

Publisher: Elsevier Science
Year: 1974
Tongue: English
Weight: 760 KB
Volume: 16
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(74)90065-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Transformations of a Graph Increasing it

Transformations of a Graph Increasing its Laplacian Polynomial and Number of Spanning Trees

✍ A.K. Kelmans 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 310 KB

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

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.

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

Extremal energies of trees with a given

Extremal energies of trees with a given domination number

✍ Kexiang Xu; Lihua Feng 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 394 KB