𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generating the maximum spanning trees of a weighted graph

✍ Scribed by Fǎnicǎ Gavril

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
395 KB
Volume
8
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding the Graph with the Maximum Numbe
Finding the Graph with the Maximum Number of Spanning Trees
✍ George Moustakides; Samuel D. Bedrosian 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 328 KB

The problem is to determine the linear graph that has the maximum number of spanning trees, where only the number of nodes N and the number of branches B are prescribed. We deal with connected graphs G(N, B) obtained by deleting D branches from a complete graph KN. Our solution is for D less than or

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

On numbers of vertices of maximum degree
On numbers of vertices of maximum degree in the spanning trees of a graph
✍ Jerzy Topp; Preben D. Vestergaard 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 611 KB

For a connected graph G, let ~-(G) be the set of all spanning trees of G and let nd(G) be the number of vertices of maximum degree in G. In this paper we show that if G is a cactus or a connected graph with p vertices and p+ 1 edges, then the set {na(T) : T C ~-(G)) has at most one gap, that is, it

Spanning trees fixed by automorphisms of
Spanning trees fixed by automorphisms of a graph
✍ M. Kano; A. Sakamoto 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 223 KB

Let G be a finite graph and A be a subgroup of Aut(G). We give a necessary and sufficient condition for the graph G to have an A-invariant spanning tree.

On the number of spanning trees in a mol
On the number of spanning trees in a molecular graph
✍ R.B. Mallion 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 444 KB

A rccenl theorem due to W'aller is applied to the mokculnr gmph of a typical conjugtcd system (naphthalene) in order to demonstrate the enumeration of spanning trees, on each of which a "ring current" calculation may be based.