✦ LIBER ✦

Graphs with prescribed connectivity and line graph connectivity

✍ Scribed by Douglas Bauer; Ralph Tindell

Publisher: John Wiley and Sons
Year: 1979
Tongue: English
Weight: 118 KB
Volume: 3
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190030410

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Chartrand and Stewart have shown that the line graph of an n‐connected graph is itself n‐connected. This paper shows that for every pair of integers m > n > 1 there is a graph of point connectivity n whose line graph has point connectivity m. The corresponding question for line connectivity is also resolved.

📜 SIMILAR VOLUMES

Realizability of p-point graphs with pre

Realizability of p-point graphs with prescribed minimum degree, maximum degree, and line connectivity

✍ F. T. Boesch; C. L. Suffel 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 316 KB

## Abstract It is well known that certain graph‐theoretic extremal questions play a central role in the study of communication network vulnerability. Herein we consider a generalization of some of the classical results in this area. We define a (__p__, Δ, δ, λ) graph as a graph having __p__ points,

Realizability of p-point, q-line graphs

Realizability of p-point, q-line graphs with prescribed maximum degree and line connectivity or minimum degree

✍ D. DiMarco 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 74 KB 👁 3 views

Realizability of p-point, q-line graphs

Realizability of p-point, q-line graphs with prescribed point connectivity, line connectivity, or minimum degree

✍ F. T. Boesch; C. L. Suffel 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 336 KB

Cycles in Graphs with Prescribed Stabili

Cycles in Graphs with Prescribed Stability Number and Connectivity

✍ M. Kouider 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 113 KB

Onk-Critical Connected Line Graphs

✍ Matthias Kriesell 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 181 KB

We show that any line graph contains a set of three vertices which is not included in a smallest separating vertex set. This was conjectured by Maurer and Slater. ## 1998 Academic Press Let }(G) denote the vertex connectivity of a graph G. A set of }(G) vertices which separates G will be called a

Hamilton connectivity of line graphs and

Hamilton connectivity of line graphs and claw-free graphs

✍ Zhiquan Hu; Feng Tian; Bing Wei 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB

## Abstract Let __G__ be a graph and let __V__~0~ = {ν∈ __V__(__G__): __d__~__G__~(ν) = 6}. We show in this paper that: (i) if __G__ is a 6‐connected line graph and if |__V__~0~| ≤ 29 or __G__[__V__~0~] contains at most 5 vertex disjoint __K__~4~'s, then __G__ is Hamilton‐connected; (ii) every 8‐co