𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Longest cycles in k-connected graphs with given independence number

✍ Scribed by Suil O; Douglas B. West; Hehui Wu

Book ID
113698880
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
164 KB
Volume
101
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Intersections of Longest Cycles in k-Con
Intersections of Longest Cycles in k-Connected Graphs
✍ Guantao Chen; Ralph J Faudree; Ronald J Gould πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 279 KB

Let G be a connected graph, where k 2. S. Smith conjectured that every two longest cycles of G have at least k vertices in common. In this note, we show that every two longest cycles meet in at least ck 3Γ‚5 vertices, where cr0.2615. ## 1998 Academic Press In this note, we provide a lower bound on

On connectivity in graphs with given cli
On connectivity in graphs with given clique number
✍ Angelika Hellwig; Lutz Volkmann πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 82 KB πŸ‘ 1 views

## Abstract We consider finite, undirected, and simple graphs __G__ of order __n__(__G__) and minimum degree Ξ΄(__G__). The connectivity ΞΊ(__G__) for a connected graph __G__ is defined as the minimum cardinality over all vertex‐cuts. If ΞΊ(__G__) < δ(__G__), then Topp and Volkmann 7 showed in 1993 f