✦ LIBER ✦

On the independent spanning trees of recursive circulant graphs with

✍ Scribed by Jinn-Shyong Yang; Jou-Ming Chang; Shyue-Ming Tang; Yue-Li Wang

Book ID: 108281514
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 895 KB
Volume: 410
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.12.042

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

The number of spanning trees in odd vale

The number of spanning trees in odd valent circulant graphs

✍ Xiebin Chen; Qiuying Lin; Fuji Zhang 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 261 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

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 spanning trees of weighted graphs

✍ Ernst W. Mayr; C. Greg Plaxton 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 874 KB