✦ LIBER ✦

Edge-disjoint spanning trees and eigenvalues

✍ Scribed by Liu, Qinghai; Hong, Yanmei; Lai, Hong-Jian

Book ID: 122318568
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 202 KB
Volume: 444
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2013.11.039

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge-disjoint spanning trees and eigenva

Edge-disjoint spanning trees and eigenvalues of graphs

✍ Li, Guojun; Shi, Lingsheng 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 191 KB

Edge-disjoint spanning trees and eigenva

Edge-disjoint spanning trees and eigenvalues of regular graphs

✍ Sebastian M. Cioabă; Wiseley Wong 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 457 KB

Connectivity and edge-disjoint spanning

Connectivity and edge-disjoint spanning trees

✍ Dan Gusfield 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 261 KB

Edge-disjoint spanning trees: A connecte

Edge-disjoint spanning trees: A connectedness theorem

✍ M. Farber; B. Richter; H. Shank 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 268 KB

Edge disjoint spanning trees in random g

Edge disjoint spanning trees in random graphs

✍ A. M. Frieze; T. Łuczak 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 145 KB

A Property on Edge-disjoint Spanning Tre

A Property on Edge-disjoint Spanning Trees

✍ Hong-Jian Lai; Hongyuan Lai; Charles Payan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 214 KB

Let G be a simple graph with n vertices and let G c denote the complement of G . Let ( G ) denote the number of components of G and G ( E ) the spanning subgraph of G with edge set E . where the minimum is taken over all such partitions . In [ Europ . J . Combin . 7 (1986) , 263 -270] , Payan conj