𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Transformations of a Graph Increasing its Laplacian Polynomial and Number of Spanning Trees

✍ Scribed by A.K. Kelmans

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
310 KB
Volume
18
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Diameter of random spanning trees in a g
Diameter of random spanning trees in a given graph
✍ Fan Chung; Paul Horn; L. Lu πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 144 KB πŸ‘ 1 views

## Abstract Motivated by the observation that the sparse tree‐like subgraphs in a small world graph have large diameter, we analyze random spanning trees in a given host graph. We show that the diameter of a random spanning tree of a given host graph __G__ is between and with high probability., w

Calculating the number of spanning trees
Calculating the number of spanning trees in a labeled planar molecular graph whose inner dual is a tree
✍ P. E. John; R. B. Mallion πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 496 KB πŸ‘ 3 views

The quantum mechanical relevance of the concept of a spanning tree extant within a given molecular graph-specifically, one that may be considered to represent the carbon-atom connectivity of a particular (planar) conjugated system-was first explicitly pointed out by Professor Roy McWeeny in his now-

A linear programming approach to increas
A linear programming approach to increasing the weight of all minimum spanning trees
✍ Mourad BaΓ―ou; Francisco Barahona πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 168 KB

## Abstract Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so that the value of all minimum spanning trees is equal to some target value. Frederickson and Solis‐Oba gave an

A lower bound on the number of spanning
A lower bound on the number of spanning trees with k end-vertices
✍ Katherine Heinrich; Guizhen Liu πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 286 KB πŸ‘ 1 views

If a graph G with cycle rank p contains both spanning trees with rn and with n end-vertices, rn < n, then G has at least 2p spanning trees with k end-vertices for each integer k, rn < k < n. Moreover, the lower bound of 2p is best possible. [ l ] and Schuster [4] independently proved that such span