Abstract
A graph is diameter critical if removal of any edge increases the diameter of the graph. In this note we construct an infinite family of counterexamples to a recent conjecture by Caccetta and Häggkvist [2] on the maximum number of edges in a diameter critical graph.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. A. Bondy and U. S. R. Murty, Graph Theory with applications, Macmillan, London, 1976.
Caccetta and Häggkvist, On diameter critical graphs, Discrete Math., 28 (1979), 223–229.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag
About this paper
Cite this paper
Krishnamoorthy, V., Nandakumar, R. (1981). A class of counterexamples to a conjecture on diameter critical graphs. In: Rao, S.B. (eds) Combinatorics and Graph Theory. Lecture Notes in Mathematics, vol 885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0092274
Download citation
DOI: https://doi.org/10.1007/BFb0092274
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11151-1
Online ISBN: 978-3-540-47037-3
eBook Packages: Springer Book Archive