𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Spanning trees with specified differences in Cayley graphs

✍ Scribed by Ben Seamone; Brett Stevens


Book ID
113567442
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
221 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Graphs with homeomorphically irreducible
✍ Michael O. Albertson; David M. Berman; Joan P. Hutchinson; Carsten Thomassen πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 509 KB

## Abstract It is an NP‐complete problem to decide whether a graph contains a spanning tree with no vertex of degree 2. We show that these homeomorphically irreducible spanning trees are contained in all graphs with minimum degree at least __c__√__n__ and in triangulations of the plane. They are ne

Graphs with all spanning trees nonisomor
✍ Lars DΓΈvling Andersen; Preben Dahl Vestergaard πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 487 KB

The paper presents some results on graphs that do not have two distinct isomorphic spanning trees. It is proved that any such connected graph with at least two vertices must have the property that each end-block has just one edge. On the other hand, the class of such graphs is quite large; it is sho

SPANNING TREES IN POLYTOPAL GRAPHS
✍ Joseph Malkevitch πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 253 KB
Spanning Trees in Regular Graphs
✍ McKay, Brendan D. πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 558 KB
On a Spanning Tree with Specified Leaves
✍ Yoshimi Egawa; Haruhide Matsuda; Tomoki Yamashita; Kiyoshi Yoshimoto πŸ“‚ Article πŸ“… 2008 πŸ› Springer Japan 🌐 English βš– 88 KB