Geodetic connectivity of graphs
IEEE Transactions on Circuits and SystemsPublished 1 August 1977
R. C. Entringer, David A. Jackson, Peter R. Slater
Citations33
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
A graph G is said to be n -geodetically connected if and only if G is connected and the removal of at least n points is required to increase the distance between any pair of points. "Geodetic" analogs of results such as Menger's theorem and Dirac's "fan" theorem are shown to hold. Some other characterizations of n -geodetically connected graphs are obtained, one of which shows geodetic connectivity to be a local property in contrast to the usual connectivity.
Keywords
Computer Science
SIAM Journal on Applied MathematicsRandomly Traceable Graphs
40 Citations1968Gary Chartrand, Hudson V. Kronk