๐”– Bobbio Scriptorium
โœฆ   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

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


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.