✦ LIBER ✦

The number of spanning trees in a class of double fixed-step loop networks

✍ Scribed by Xuerong Yong; Yuanping Zhang; Mordecai J. Golin

Publisher: John Wiley and Sons
Year: 2008
Tongue: English
Weight: 140 KB
Volume: 52
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20223

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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-

A multiple time step algorithm compatibl

A multiple time step algorithm compatible with a large number of distance classes and an arbitrary distance dependence of the time step size for the fast evaluation of nonbonded interactions in molecular simulations

✍ Vincent Kräutler; Philippe H. Hünenberger 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB

## Abstract A new algorithm is introduced to perform the multiple time step integration of the equations of motion for a molecular system, based on the splitting of the nonbonded interactions into a series of distance classes. The interactions between particle pairs in successive classes are update