𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The structure of graphs with a vital linkage of order 2

✍ Scribed by Dillon Mayhew; Geoff Whittle; Stefan H. M. van Zwam

Book ID
102339890
Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
98 KB
Volume
71
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

A linkage of order k of a graph G is a subgraph with k components, each of which is a path. A linkage is vital if it spans all vertices, and no other linkage connects the same pairs of end vertices. We give a characterization of the graphs with a vital linkage of order 2: they are certain minors of a family of highly structured graphs.

πŸ“œ SIMILAR VOLUMES

The Structure of Random Graph Orders
The Structure of Random Graph Orders
✍ BollobΓ‘s, BΓ©la; Brightwell, Graham πŸ“‚ Article πŸ“… 1997 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 374 KB
The structure of (t,r)-regular graphs of
The structure of (t,r)-regular graphs of large order
✍ Robert E. Jamison; Peter D. Johnson Jr. πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 97 KB

A graph is (t; r)-regular i it has at least one independent t-set of vertices and the open neighborhood of any such set contains exactly r vertices. Our goal is to show that when t ΒΏ 3 and the order is su ciently large, then the structure of (t; r)-regular graphs is similar to, but not exactly the s