✦ LIBER ✦

Edge-disjoint spanning trees and eigenvalues of graphs

✍ Scribed by Li, Guojun; Shi, Lingsheng

Book ID: 121954305
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 191 KB
Volume: 439
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2013.08.041

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Edge-disjoint spanning trees and eigenva

Edge-disjoint spanning trees and eigenvalues

✍ Liu, Qinghai; Hong, Yanmei; Lai, Hong-Jian 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 202 KB

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