|
[1] M. Atici, Graph operations and geodetic numbers. Proceedings of the Thirtieth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1999) 141 (1999), 95{110. [2] M. Atici, On the edge geodetic number of a graph, Int. J. Comput. Math. 80 (2003), no. 7, 853{861. [3] G. B. Chae, E. M. Palmer and W. C. Siu, Geodetic number of random graphs of diameter 2, Australas. J. Combin. 26 (2002), 11{20. [4] G. Chartrand, F. Harary and P. Zhang, On the geodetic number of a graph, Networks 39 (2002), 1{6. [5] G. Chartrand, E. M. Palmer and P. Zhang, The geodetic number of a graph: a survey, Proceedings of the Thirty-third Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 2002) 156 (2002), 37{58. [6] G. Chartrand and P. Zhang, The forcing geodetic number of a graph, Discuss. Math. Graph Theory 19 (1999), no. 1, 45{58. [7] G. Chartrand and P. Zhang, The geodetic number of an oriented graph, European J. Combin 21 (2000), no. 2, 181{189. [8] A. L. Douthat and M. C. Kong, Computing the geodetic number of bipartite graphs, Proceedings of the Twenty-sixth Southeastern International Conference 16 on Combinatorics Graph Theory and Computing (Boca Raton, FL, 1995) 107 (1995), 113{119. [9] F. Harary, E. Loukakis and C. Tsouros The geodetic number of a graph, Graph- theoretic Models in Computer Science, II (Las Cruces, NM, 1988{1990), Math. Comput. Modelling 17 (1993), no. 11, 89{95. [10] P. Zhang, The upper forcing geodetic number of a graph, Ars Combin 62 (2002), 3{15
|