Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T20:15:05.991Z Has data issue: false hasContentIssue false

Cycles and Connectivity in Graphs

Published online by Cambridge University Press:  20 November 2018

M. E. Watkins
Affiliation:
University of North Carolina, Chapel Hill, North Carolina
D. M. Mesner
Affiliation:
University of North Carolina, Chapel Hill, North Carolina
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this note, G will denote a finite undirected graph without multiple edges, and V = V(G) will denote its vertex set. The largest integer n for which G is n-vertex connected is the vertex-connectivity of G and will be denoted by λ = λ(G). One defines ζ to be the largest integer z not exceeding |V| such that for any set U ⊂ V with |U| = z, there is a cycle in G which contains U. The symbol i(U) will denote the component index of U. As a standard reference for this and other terminology, the authors recommend O. Ore (3).

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1967