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

Counting the spanning trees of a labelled molecular-graph

โœ Scribed by Gutman, I.; Mallion, R.B.; Essam, J.W.

Book ID
120391471
Publisher
Taylor and Francis Group
Year
1983
Tongue
English
Weight
957 KB
Volume
50
Category
Article
ISSN
0026-8976

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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.

Calculating the number of spanning trees
Calculating the number of spanning trees in a labeled planar molecular graph whose inner dual is a tree
โœ P. E. John; R. B. Mallion ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 496 KB ๐Ÿ‘ 3 views

The quantum mechanical relevance of the concept of a spanning tree extant within a given molecular graph-specifically, one that may be considered to represent the carbon-atom connectivity of a particular (planar) conjugated system-was first explicitly pointed out by Professor Roy McWeeny in his now-

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.

The number of spanning trees of a graph
The number of spanning trees of a graph
โœ Kinkar C Das,Ahmet S Cevik,Ismail N Cangul ๐Ÿ“‚ Article ๐Ÿ“… 2013 ๐Ÿ› Hindawi Publishing Corporation ๐ŸŒ English โš– 207 KB