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

On the choice of a spanning tree for greedy embedding of network graphs

โœ Scribed by Andrej Cvetkovski, Mark Crovella

Book ID
120709082
Publisher
Springer-Verlag
Year
2013
Weight
905 KB
Volume
3
Category
Article
ISSN
2076-0310

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the spanning trees of weighted graphs
On the spanning trees of weighted graphs
โœ Ernst W. Mayr; C. Greg Plaxton ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 874 KB
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
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.