Some remarks on the geodetic number of a graph

Discrete Mathematics

Volumn 310, Issue 4, 2010, Pages 832-837

  Dourado, Mitre C ^a   Protti, Fábio ^b   Rautenbach, Dieter ^c   Szwarcfiter, Jayme L ^d  

^a FEDERAL RURAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

^c ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

^d FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Cograph; Convex hull; Convex set; Geodetic number; Split graph; Unit interval graph

Indexed keywords

COGRAPH; CONVEX HULL; CONVEX SET; GEODETIC NUMBER; SPLIT GRAPHS; UNIT INTERVALS;

COMPUTATIONAL GEOMETRY; GEODESY; SET THEORY;

GRAPH THEORY;

EID: 71649096750     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2009.09.018     Document Type: Article

References (17)

1. Alon N., and Spencer J.H. The Probabilistic Method. With an Appendix on the Life and Work of Paul Erdo{double acute}s. 3rd ed. (2008), John Wiley & Sons
2. Atici M. Graph operations and geodetic numbers. Congr. Numer. 141 (1999) 95-110
3. Atici M. Computational complexity of geodetic set. Int. J. Comput. Math. 79 (2002) 587-591
4. Bogart K.P., and West D.B. A short proof that 'proper=unit'. Discrete Math. 201 (1999) 21-23
5. Booth K.S., and Johnson J.H. Dominating sets in chordal graphs. SIAM J. Comput. 11 (1982) 191-199
6. Brandstädt A., Le V.B., and Spinrad J.P. Graph classes: A survey. SIAM Monogr. Discrete Math. (1999) 304
7. Cáceres J., Hernando M.C., Mora M., Pelayo I.M., Puertas M.L., and Seara C. On geodetic sets formed by boundary vertices. Discrete Math. 306 (2006) 188-198
8. Chartrand G., Harary F., and Zhang P. Extremal problems in geodetic graph theory. Congr. Numer. 131 (1998) 55-66
9. Chartrand G., Harary F., and Zhang P. On the geodetic number of a graph. Networks 39 (2002) 1-6
10. Chartrand G., Palmer E.M., and Zhang P. The geodetic number of a graph: A survey. Congr. Numer. 156 (2002) 37-58
11. Deng X., Hell P., and Huang J. Linear-time representation algorithms for proper circular-arc graphs and proper interval graphs. SIAM J. Comput. 25 (1996) 390-403
12. Harary F., Loukakis E., and Tsouros C. The geodetic number of a graph. Math. Comput. Modelling 17 (1993) 89-95
13. Hernando C., Jiang T., Mora M., Pelayo I.M., and Seara C. On the Steiner, geodetic and hull numbers of graphs. Discrete Math. 293 (2005) 139-154
14. R.M. McConnell, J.P. Spinrad, Linear-time modular decomposition and efficient transitive orientation of comparability graphs, in: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 1994, pp. 536-545
15. McConnell R.M., and Spinrad J.P. Ordered vertex partitioning. Discrete Math. Theor. Comput. Sci. 4 (2000) 45-60
16. Müller H., and Brandstädt A. The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs. Theor. Comput. Sci. 53 (1987) 257-265
17. Roberts F.S. Indifference graphs. Proof Techniques in Graph Theory (1969), Academic Press