Back
 OJDM  Vol.12 No.1 , January 2022
Geodetic Number and Geo-Chromatic Number of 2-Cartesian Product of Some Graphs
Abstract: A set S ⊆ V (G) is called a geodetic set if every vertex of G lies on a shortest u-v path for some u, v ∈ S, the minimum cardinality among all geodetic sets is called geodetic number and is denoted by . A set C ⊆ V (G) is called a chromatic set if C contains all vertices of different colors in G, the minimum cardinality among all chromatic sets is called the chromatic number and is denoted by . A geo-chromatic set Sc ⊆ V (G) is both a geodetic set and a chromatic set. The geo-chromatic number  of G is the minimum cardinality among all geo-chromatic sets of G. In this paper, we determine the geodetic number and the geo-chromatic number of 2-cartesian product of some standard graphs like complete graphs, cycles and paths.
Cite this paper: Huilgol, M. and Divya, B. (2022) Geodetic Number and Geo-Chromatic Number of 2-Cartesian Product of Some Graphs. Open Journal of Discrete Mathematics, 12, 1-16. doi: 10.4236/ojdm.2022.121001.
References

[1]   Acharya, U.P. and Mehta, H.S. (2015) Generalized Cartesian Product of Graphs. International Journal of Mathematics and Scientific Computing, 5, 4-7.

[2]   Acharya, U.P. and Mehta, H.S. (2014) 2-Cartesian Product of Special Graphs. International Journal of Mathematics and Soft Computing, 4, 139-144.

[3]   Harary, F., Loukakis, E. and Tsouros, C. (1993) The Geodetic Number of a Graph. Mathematical and Computer Modelling, 17, 89-95.

[4]   Chartrand, G., Harary, F. and Zhang, P. (2002) On the Geodetic Number of a Graph. Networks, 39, 1-6.
https://doi.org/10.1002/net.10007

[5]   Chartrand, G., Harary, F. and Zhang, P. (2000) Geodetic Sets in Graphs. Discussiones Mathematicae Graph Theory, 20, 129-138.
https://doi.org/10.7151/dmgt.1112

[6]   Samli, B.S. and Chellathurai, R.S. (2018) Geochromatic Number of a Graph. International Journal of Scientific Research in Mathematical and Statistical Sciences, 5, 259-264.

[7]   Stanis Arul Mary, S.A. (2020) Geo Chromatic Number for Certain Cartesian Product of Graphs. International Journal of Mathematics Trends and Technology, 66, 40-43.
https://doi.org/10.14445/22315373/IJMTT-V66I1P507

[8]   Huilgol, M.I. and Divya, B. (2021) Geochromatic Number of Cartesian Product of Some Graphs. Journal of Mathematics and Computer Science, 11, 3866-3886.

[9]   Buckley, F. and Harary, F. (1990) Distance in Graphs. Addison-Wesley Publishing Company, Redwood City.

[10]   Khayoom, M.M.A., Arul, P. and Sudhahar, P. (2017) Monophonic Chromatic Parameter in a Connected Graph. International Journal of Mathematical Analysis, 11, 911-920.
https://doi.org/10.12988/ijma.2017.78114

[11]   Breser, B., Klavžar, S. and Horvat, S.T. (2008) On the Geodetic Number and Related Metric Sets in Cartesian Product Graphs. Discrete Mathematics, 308, 5555-5561.

[12]   Hammack, R., Imrich, W. and Klavzar, S. (2011) Handbook of Product of Graphs. CRC Press, New York.

[13]   Mulder, H.M. (1980) The Interval Function of a Graph. Vol. 132, Mathematisch Centrum, Amsterdam.

[14]   Xaviour, X.L. and Chellathurai, R.S. (2020) Geodetic Global Domination in the Join of Two Graphs. International Journal of Recent Technology and Engineering, 8, 4579-4583.
https://doi.org/10.35940/ijrte.E6770.018520

[15]   Xaviour, X.L. and Prakash, S.V.A. (2018) Isolate Geodetic Number of a Graph. Journal of Applied Science and Computations, 5, 755-765.

 
 
Top