✦ LIBER ✦

The geometry of inner spanning trees for planar polygons

✍ Scribed by Ivanov, Alexandr O; Tuzhilin, Alexey A

Book ID: 118197401
Publisher: Turpion Limited
Year: 2012
Tongue: English
Weight: 377 KB
Volume: 76
Category: Article
ISSN: 1064-5632
DOI: 10.1070/im2012v076n02abeh002581

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-

The Size of Spanning Disks for Polygonal

The Size of Spanning Disks for Polygonal Curves

✍ Hass; Snoeyink; Thurston 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 331 KB

A linear algorithm for analysis of minim

A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs

✍ Heather Booth; Jeffery Westbrook 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 713 KB

The mean intercept length polygons for s

The mean intercept length polygons for systems of planar nets

✍ G. M. Luo; A. M. Sadegh; S. C. Cowin 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 651 KB

Application of minimal spanning trees in

Application of minimal spanning trees in glioma grading — a CLIPPER program for the calculation and construction of minimal spanning trees

✍ Harry Kolles; Henning Ludt; Giles H. Vince; Wolfgang Feiden 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 367 KB

Upper bounds for the number of spanning

Upper bounds for the number of spanning trees of graphs

✍ Ş Burcu Bozkurt 📂 Article 📅 2012 🏛 Hindawi Publishing Corporation 🌐 English ⚖ 162 KB