✦ LIBER ✦

The number of spanning trees in odd valent circulant graphs

✍ Scribed by Xiebin Chen; Qiuying Lin; Fuji Zhang

Book ID: 108113411
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 261 KB
Volume: 282
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2003.12.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The asymptotic number of spanning trees

The asymptotic number of spanning trees in circulant graphs

✍ Mordecai J. Golin; Xuerong Yong; Yuanping Zhang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 716 KB

On the number of spanning trees in direc

On the number of spanning trees in directed circulant graphs

✍ Zbigniew Lonc; Krzysztof Parol; Jacek M. Wojciechowski 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB

Further analysis of the number of spanni

Further analysis of the number of spanning trees in circulant graphs

✍ Talip Atajan; Xuerong Yong; Hiroshi Inaba 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 217 KB

Number of Spanning Trees of Circulant Gr

Number of Spanning Trees of Circulant Graphs C6n and their Applications

✍ Helmi, 📂 Article 📅 2012 🏛 Science Publications 🌐 English ⚖ 129 KB

On the asymptotic behavior of the maximu

On the asymptotic behavior of the maximum number of spanning trees in circulant graphs

✍ Lonc, Zbigniew; Parol, Krzysztof; Wojciechowski, Jacek M. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 3 views

The following asymptotic estimation of the maximum number of spanning trees f k (n) in 2kregular circulant graphs ( k ú 1) on n vertices is the main result of this paper: )) , where

On the independent spanning trees of rec

On the independent spanning trees of recursive circulant graphs with

✍ Jinn-Shyong Yang; Jou-Ming Chang; Shyue-Ming Tang; Yue-Li Wang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 895 KB