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

New method for counting the number of spanning trees in a two-tree network

โœ Scribed by Xiao, Yuzhi; Zhao, Haixing

Book ID
122804290
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
731 KB
Volume
392
Category
Article
ISSN
0378-4371

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Counting the number of spanning trees in
Counting the number of spanning trees in a class of double fixed-step loop networks
โœ Talip Atajan; Naohisa Otsuka; Xuerong Yong ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 495 KB

A double fixed-step loop network, C p,q n , is a digraph on n vertices 0, 1, 2, . . . , n -1 and for each vertex i (0 < i โ‰ค n-1), there are exactly two arcs going from vertex i to vertices i+p, i + q (mod n). Let p < q < n be positive integers such that (qp) ฤŽ n and (qp)|(k 0 np) or (qp)|n (where k

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.