๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The number of spanning trees in an iterative contact graph composed of general cells

โœ Scribed by Kimio Sato; Rikio Onodera

Book ID
112075701
Publisher
John Wiley and Sons
Year
1988
Tongue
English
Weight
800 KB
Volume
71
Category
Article
ISSN
8756-6621

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The number of spanning trees of a graph
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.