✦ LIBER ✦

Edge-disjoint spanning trees and eigenvalues of regular graphs

✍ Scribed by Sebastian M. Cioabă; Wiseley Wong

Book ID: 113772314
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 457 KB
Volume: 437
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2012.03.013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge-Disjoint Spanning Trees of Finite G

Edge-Disjoint Spanning Trees of Finite Graphs

✍ Nash-Williams, C. St.J. A. 📂 Article 📅 1961 🏛 Oxford University Press 🌐 English ⚖ 399 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

Connectivity and edge-disjoint spanning

Connectivity and edge-disjoint spanning trees

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

Embedding k(n−k) edge-disjoint spanning

Embedding k(n−k) edge-disjoint spanning trees in arrangement graphs

✍ Chin-Tsai Lin 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 278 KB

The arrangement graphs are a class of generalized star graphs. In this paper we construct a graph that consists of the maximum number of directed edge-disjoint spanning trees in an arrangement graph. The paths that connect the common root node to any given node through different spanning trees are n

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 and depth-f

Edge-disjoint spanning trees and depth-first search

✍ Robert Endre Tarjan 📂 Article 📅 1976 🏛 Springer-Verlag 🌐 English ⚖ 707 KB