DocumentCode
1179266
Title
Geodetic connectivity of graphs
Author
Entringer, Roger C. ; Jackson, Douglas E. ; Slater, Peter J.
Volume
24
Issue
8
fYear
1977
fDate
8/1/1977 12:00:00 AM
Firstpage
460
Lastpage
463
Abstract
A graph 
is said to be 
-geodetically connected if and only if is connected and the removal of at least 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 -geodetically connected graphs are obtained, one of which shows geodetic connectivity to be a local property in contrast to the usual connectivity.
is said to be -geodetically connected if and only if is connected and the removal of at least 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 -geodetically connected graphs are obtained, one of which shows geodetic connectivity to be a local property in contrast to the usual connectivity.Keywords
Graph theory; Accidents; Communication networks; Electric breakdown; Joining processes; Laboratories; Mathematics; Power generation economics; Statistics; Telephony; Terminology;
fLanguage
English
Journal_Title
Circuits and Systems, IEEE Transactions on
Publisher
ieee
ISSN
0098-4094
Type
jour
DOI
10.1109/TCS.1977.1084370
Filename
1084370
Link To Document