PDF
Discussiones Mathematicae Graph Theory 30(1) (2010)
55-73
DOI: https://doi.org/10.7151/dmgt.1476
THE EDGE GEODETIC NUMBER AND CARTESIAN PRODUCT OF GRAPHS
A.P. Santhakumaran and S.V. Ullas Chandran
Department of Mathematics
St. Xavier's College (Autonomous)
Palayamkottai - 627 002, India
e-mail: apskumar1953@yahoo.co.in
e-mail: ullaschandra01@yahoo.co.in
Abstract
For a nontrivial connected graph G = (V(G),E(G)), a set S⊆ V(G) is called an edge geodetic set of G if every edge of G is contained in a geodesic joining some pair of vertices in S. The edge geodetic number g1(G) of G is the minimum order of its edge geodetic sets. Bounds for the edge geodetic number of Cartesian product graphs are proved and improved upper bounds are determined for a special class of graphs. Exact values of the edge geodetic number of Cartesian product are obtained for several classes of graphs. Also we obtain a necessary condition of G for which g1(G[¯] K2) = g1(G).Keywords: geodetic number, edge geodetic number, linear edge geodetic set, perfect edge geodetic set, (edge, vertex)-geodetic set, superior edge geodetic set.
2010 Mathematics Subject Classification: 05C12.
References
| [1] | B. Bresar, S. Klavžar and A.T. Horvat, On the geodetic number and related metric sets in Cartesian product graphs, (2007), Discrete Math. 308 (2008) 5555-5561, doi: 10.1016/j.disc.2007.10.007. |
| [2] | F. Buckley and F. Harary, Distance in Graphs (Addison-Wesley, Redwood City, CA, 1990). |
| [3] | G. Chartrand, F. Harary and P. Zhang, On the geodetic number of a graph, Networks 39 (2002) 1-6, doi: 10.1002/net.10007. |
| [4] | G. Chartrand and P. Zhang, Introduction to Graph Theory (Tata McGraw-Hill Edition, New Delhi, 2006). |
| [5] | F. Harary, E. Loukakis and C. Tsouros, The geodetic number of a graph, Math. Comput. Modeling 17 (1993) 89-95, doi: 10.1016/0895-7177(93)90259-2. |
| [6] | W. Imrich and S. Klavžar, Product Graphs: Structure and Recognition (Wiley-Interscience, New York, 2000). |
| [7] | A.P. Santhakumaran and J. John, Edge geodetic number of a graph, J. Discrete Math. Sciences & Cryptography 10 (2007) 415-432. |
Received 28 May 2008
Revised 11 December 2008
Accepted 21 January 2009
Close