✦ LIBER ✦

Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs

✍ Scribed by Zhang Fuji; Yong Xuerong

Publisher: SP Science China Press
Year: 1999
Tongue: English
Weight: 383 KB
Volume: 42
Category: Article
ISSN: 1674-7283
DOI: 10.1007/bf02879060

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the number of spanning trees and Eule

On the number of spanning trees and Eulerian tours in iterated line digraphs

✍ Zhang Huaxiao; Zhang Fuji; Huang Qiongxiang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 448 KB

On the numbers of spanning trees and Eul

On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs

✍ Xueliang Li; Fuji Zhang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 756 KB

The NP-completeness of finding A-trails

The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs

✍ Lars Døvling Andersen; Herbert Fleischner 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 821 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