Graphs with prescribed connectivity and line graph connectivity

Douglas Bauer, Ralph Tindell

Research output: Contribution to journalArticle

3 Citations (Scopus)

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.

Original languageEnglish (US)
Pages (from-to)393-395
Number of pages3
JournalJournal of Graph Theory
Volume3
Issue number4
DOIs
StatePublished - Jan 1 1979

Fingerprint

Graph Connectivity
Line Graph
Connectivity
Graph in graph theory
Integer
Line

All Science Journal Classification (ASJC) codes

  • Geometry and Topology

Cite this

@article{9026adb7b70f41d0bd604d144cf66d28,
title = "Graphs with prescribed connectivity and line graph connectivity",
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.",
author = "Douglas Bauer and Ralph Tindell",
year = "1979",
month = "1",
day = "1",
doi = "https://doi.org/10.1002/jgt.3190030410",
language = "English (US)",
volume = "3",
pages = "393--395",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "4",

}

Graphs with prescribed connectivity and line graph connectivity. / Bauer, Douglas; Tindell, Ralph.

In: Journal of Graph Theory, Vol. 3, No. 4, 01.01.1979, p. 393-395.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Graphs with prescribed connectivity and line graph connectivity

AU - Bauer, Douglas

AU - Tindell, Ralph

PY - 1979/1/1

Y1 - 1979/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=43249113106&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=43249113106&partnerID=8YFLogxK

U2 - https://doi.org/10.1002/jgt.3190030410

DO - https://doi.org/10.1002/jgt.3190030410

M3 - Article

VL - 3

SP - 393

EP - 395

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 4

ER -