Abstract
Given a simple connected graph G = (V, E) the geodetic closure \(I[S] \subset V\) of a subset S of V is the union of all sets of nodes lying on some geodesic (or shortest path) joining a pair of nodes \(v_k,v_l \in S\). The geodetic number, denoted by g(G), is the smallest cardinality of a node set S * such that I[S *] = V. In “The geodetic number of a graph”, [Harary et al. in Math. Comput. Model. 17:89–95, 1993] propose an incorrect algorithm to find the geodetic number of a graph G. We provide counterexamples and show why the proposed approach must fail. We then develop a 0–1 integer programming model to find the geodetic number. Computational results are given.
Similar content being viewed by others
References
Atici M. (2002) Computational complexity of geodetic set. Int. J. Comput. Math. 79(5): 587–591
Atici M. (2003) On the edge geodetic number of a graph. Int. J. Comput. Math. 80(7): 853–861
Atici M., Vince A. (2002) Geodesics in graphs, an extremal set problem, and perfect hash families. Graphs Combin. 18, 403–413
Buckley F., Harary F. (1990) Distance in Graphs. Addison-Wesley, Redwood City
Chang G.J., Tong L.-D., Wang H.-T. (2004) Geodetic spectra of graphs. Eur. J. Combin. 25, 383–391
Chartrand, G., Harary, F., Zang, P.: On the geodetic number of a graph. Networks, 39(1), (2002)
Chartrand G., Zang P. (2000) The geodetic number of an oriented graph. Eur. J. Combin. 21, 181–189
Harary F., Loukakis E., Tsouros C. (1993) The geodetic number of a graph. Math. Comput. Modell. 17, 89–95
Hernando C., Jiang T., Mora M., Pelayo I.M., Seara C. (2005) On the steiner, geodetic and hull numbers of graphs. Discrete Math. 293, 139–154
Pelayo, I.: On convexity in graphs. http://www.personal.telefonica.terra.es/web/ipm/research/Definitions.pdf, cited on October (2003)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hansen, P., van Omme, N. On pitfalls in computing the geodetic number of a graph. Optimization Letters 1, 299–307 (2007). https://doi.org/10.1007/s11590-006-0032-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-006-0032-3