✦ LIBER ✦

On the spanning trees of weighted graphs

✍ Scribed by Ernst W. Mayr; C. Greg Plaxton

Publisher: Springer-Verlag
Year: 1992
Tongue: English
Weight: 874 KB
Volume: 12
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01305236

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Non-uniform random spanning trees on wei

Non-uniform random spanning trees on weighted graphs

✍ M. Mosbah; N. Saheb 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 547 KB

Generating the maximum spanning trees of

Generating the maximum spanning trees of a weighted graph

✍ Fǎnicǎ Gavril 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 395 KB

Spanning trees of dual graphs

✍ Norman Biggs 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 210 KB

Spanning trees of extended graphs

✍ A. K. Kelmans 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 364 KB

Heavy cycles and spanning trees with few

Heavy cycles and spanning trees with few leaves in weighted graphs

✍ Binlong Li; Shenggui Zhang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 205 KB

Let G be a 2-connected weighted graph and k ≥ 2 an integer. In this note we prove that if the sum of the weighted degrees of every k + 1 pairwise nonadjacent vertices is at least m, then G contains either a cycle of weight at least 2m/(k + 1) or a spanning tree with no more than k leaves.

On graphs with the maximum number of spa

On graphs with the maximum number of spanning trees

✍ Alexander K. Kelmans 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 814 KB

Let 3:; denote the set of simple graphs with n vertices and m edges, t ( G ) the number of spanning trees of a graph G , and F 2 H if t(K,\E(F))?t(K,\E(H)) for every s? max{u(F), u ( H ) } . We give a complete characterization of >-maximal (maximum) graphs in 3:; subject to m 5 n . This result conta