Abstract
For a connected graph G = (V, E) of order n ≥ 2, a set \({S\subseteq V}\) is a 2-edge geodetic set of G if each edge \({e\in E - E(S)}\) lies on a u-v geodesic with d(u, v) = 2 for some vertices u and v in S. The minimum cardinality of a 2-edge geodetic set in G is the 2-edge geodetic number of G, denoted by eg2(G). It is proved that for any connected graph G, β1(G) ≤ eg2(G), where β1(G) is the matching number of G. It is shown that every pair a, b of integers with 2 ≤ a ≤ b is realizable as the matching number and 2-edge geodetic number, respectively, of some connected graph. We determine bounds for the 2-edge geodetic number of Cartesian product of graphs. Also we determine the 2-edge geodetic number of certain classes of Cartesian product graphs. The 2-edge geodetic number of join of two graphs is obtained in terms of the 2-edge geodetic number of the factor graphs.
![](http://media.springernature.com/lw685/springer-static/image/art%3A10.1007%2Fs40065-012-0016-3/MediaObjects/40065_2012_16_Article_Figa_HTML.gif)
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Attici M.: Computational complexity of geodetic sets. Int. J. Comput. Math. 79, 587–591 (2002)
Brešar B., Klavžar S., Horvat A.T.: On the geodetic number and related metric sets in Cartesian product graphs. Discret. Math. 308, 5555–5561 (2008)
Buckley F., Harary F.: Distance in Graphs. Addison-Wesley, Redwood City (1990)
Chartrand G., Harary F., Zhang P.: On the geodetic number of a graph. Networks 39(1), 1–6 (2002)
Chartrand G., Zhang P.: Introduction to Graph Theory. Tata McGraw-Hill Edition, New Delhi (2006)
Gera R., Zhang P.: On k-geodomination in Cartesian products. Congr. Numer. 158, 63–178 (2002)
Harary F.: Graph Theory. Addison-Wesley, Redwood City (1969)
Imrich W., Klavžar S.: Product Graphs: Structure and Recognition. Wiley-Interscience, New York (2000)
Muntean R., Zhang P.: On geodomination in graphs. Congr. Numer. 143, 161–174 (2000)
Muntean R., Zhang P.: k-Geodomination in graphs. ARS Combin. 63, 33–47 (2002)
Santhakumaran A.P., John J.: Edge geodetic number of a graph. J. Discret Math. Sci. Crypt. 10(3), 415–432 (2007)
Santhakumaran, A.P.; Ullas Chandran, S.V.: The k-edge geodetic number of a graph. Util. Math. (2012)
Santhakumaran A.P., Ullas Chandran S.V.: The edge geodetic number and Cartesian product of graphs. Discuss. Math. Graph Theory 30(1), 55–73 (2010)
Acknowledgments
Research supported by DST Project No. SR/S4/MS: 319/06.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Santhakumaran, A.P., Ullas Chandran, S.V. The 2-edge geodetic number and graph operations. Arab. J. Math. 1, 241–249 (2012). https://doi.org/10.1007/s40065-012-0016-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40065-012-0016-3