Coding and counting spanning trees in Kleitman-Golden graphs

Counting spanning trees in the graphs of

Counting spanning trees in the graphs of Kleitman and Golden and a generalization

✍ R. Vohra; L. Washington 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 302 KB

A new calculation is given for the number of spanning trees in a family of labellec; graphs considered by Kleitman and Golden, and for a more general class of such graphs.

Connected Factors and Spanning Trees in

Connected Factors and Spanning Trees in Graphs

✍ Taro Tokuda; Baoguang Xu; Jianfang Wang 📂 Article 📅 2003 🏛 Springer Japan 🌐 English ⚖ 81 KB

Maximizing spanning trees in almost comp

Maximizing spanning trees in almost complete graphs

✍ Gilbert, Bryan; Myrvold, Wendy 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB 👁 2 views

We examine the family of graphs whose complements are a union of paths and cycles and develop a very simple algebraic technique for comparing the number of spanning trees. With our algebra, we can obtain a simple proof of a result of Kel'mans that evening out path lengths increases the number of spa

Maximizing spanning trees in almost comp

Maximizing spanning trees in almost complete graphs

✍ Gilbert, Bryan; Myrvold, Wendy 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB 👁 2 views

We examine the family of graphs whose complements are a union of paths and cycles and develop a very simple algebraic technique for comparing the number of spanning trees. With our algebra, we can obtain a simple proof of a result of Kel'mans that evening-out path lengths increases the number of spa

Maximum matchings in bipartite graphs vi

Maximum matchings in bipartite graphs via strong spanning trees

✍ M. L. Balinski; J. Gonzalez 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 692 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.