The edge-to-edge geodetic domination number of a graph

• John, J. ^[2] ; Sujin Flower, V. ^[1]
  1. [1] Holy Cross College

     Holy Cross College

     Township of Portage, Estados Unidos

     
  2. [2] Government College of Engineering
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 40, Nº. 3, 2021 (Ejemplar dedicado a: In progress (June 2021). This issue is in progress. Contains articles that are final and fully citable.), págs. 635-658
• Idioma: inglés
• DOI: 10.22199/issn.0717-6279-4057
• Enlaces
  • Texto completo
• Resumen

  • Let G = (V, E) be a connected graph with at least three vertices. A set S Í E is called an edge-to-edge geodetic dominating set of G if S is both an edge-to-edge geodetic set of G and an edge dominating set of G. The edge-to- edge geodetic domination number ¡gee(G) of G is the minimum cardinality of its edge-to-edge geodetic dominating sets and any edge-to-edge geodetic dominating set of minimum cardinality is said to be a gee- set of G. Some general properties satisfied by this concept are studied. Connected graphs of size m?2 with edge-to-geodetic domination number 2 or m or m-1 are charaterized. We proved that if G is a connected graph of size m ? 3 and G­ is also connected,then 4 ?¡gee(G) + ¡gee(G­) ? 2m -2. Moreover we characterized graphs for which the lower and the upper bounds are sharp. It is shown that, for every pair of positive integers a and b with 2 ?a ? b, there exists a connected graph G with gee(G) = a and ¡gee(G) = b. Also it is shown that, for every pair of positive integers a and b with 2 < a ? b, there exists a connected graph G with ¡e(G) = a and¡ gee(G) = b, where ¡e(G) is the edge domination number of G and gee(G) is the edge-to-edge geodetic number of G.

• Referencias bibliográficas
  • M. Antony and A. L. Merlin Sheela, “The edge-to-edge geodetic number of a graph”, Journal of applied science and computation, vol. 6, no....
  • S. Arumugam and S. Velammal, “Edge domination in graphs”, Taiwanese journal of mathematics, vol. 2, no. 2, pp. 173-179, 1998, doi: 10.11650/twjm/1500406930
  • B. Xu, “On edge domination number of graphs”, Discrete mathematics, vol. 294, no. 3, pp. 311-316, 2005, doi: 10.1016/j.disc.2004.11.008
  • S. Beulah Samli and S. Robinson Chellathurai, “Geo chromatic number of a graph”, International Journal of Scientific Research in Mathematical...
  • S. Beulah Samli. J. John , and S. Robinson Chellathurai, “The double geo chromatic number of a graph”, Bulletin of the International Mathematical...
  • G. Chartrand, F. Harary, and P. Zhang, “On the geodetic number of a graph”, Networks, vol. 39, no. 1, pp. 1-6, 2002, doi: 10.1002/net.10007
  • G. Chartrand, E. M. Palmer, and P. Zhang, “The geodetic number of a graph: a survey”, Congressus numerantium, vol. 156, pp. 37-58, 2002.
  • R. D. Dutton and R. C. Brigham, “An external problem for edge domination insensitive graphs”, Discrete applied mathematics, vol. 20, no. 3,...
  • T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Fundamentals of domination in graphs. New York, NY: M. Dekker, 1998.
  • A. Hansberg, and L. Volkmann, “On the geodetic and geodetic domination numbers of a graph”, Discrete mathematics, vol. 310, no. 15-16, pp....
  • J. John, G. Edwin, and P. A. P. Sudhahar, “The Steiner domination number of a graph”, International journal of mathematics and computer applications...
  • J. John and N. Arianayagam, “The detour domination number of a graph”, Discrete mathematics, algorithms and applications, vol. 9, no. 1, Art....
  • J. John, P. A. P. Sudhahar, and D. Stalin, “On the (M, D) number of a graph”, Proyecciones (Antofagasta), vol. 38, no. 2, pp. 255-266, 2019,...
  • J. John and D. Stalin, “Edge geodetic self-decomposition in graphs”, Discrete mathematics, algorithms and applications, vol. 12, no. 5, Art....
  • J. John and D. Stalin, “The edge geodetic self decomposition number of a graph”, RAIRO - Operations Research, vol. 55, 2021, doi: 10.1051/ro/2020073
  • S. Mitchell and S. T. Hedetniemi, “Edge domination in trees”, Congressus numerantium, vol. 19, pp. 489-509, 1977.
  • M. N. S. Paspasan and S. R. Canoy Jr, “Edge domination and total edge domination in the join of graphs”, Applied mathematical science, vol....
  • M. N. S. Paspasan and S. R. Canoy Jr, “Edge domination in lexico and cartesian products of graphs”, Far east journal of mathematical science,...
  • M. Hajian, M. A. Henning, and N. J. Rad, “A new lower bound on the domination number of a graph”, Journal of combinatorial optimization, vol....
  • P. Gupta, “Domination in graph with application”, Paripex indian journal of research, vol. 2, no. 3, pp. 115-117, 2013. [On line]. Available:...
  • A. P. Santhakumaran and J. John, “On the edge-to-vertex geodetic number of a graph”, Miskolc mathematical notes, vol. 13, no. 1, pp. 107–119,...
  • A. P. Santhakumaran and J. John, “The upper connected edge geodetic number of a graph”, Filomat, vol. 26, no. 1, pp. 131-141, 2012, doi: 10.2298/FIL1201131S
  • D. Stalin and J. John, “Edge geodetic dominations in graphs”, International journal of pure and applied mathematics, vol. 116, no. 22, pp....
  • S. Sujitha, J. John, and A. Vijayan, “Extreme edge-to-vertex geodesic graphs”, International journal of mathematics research, vol. 6, no....
  • S. Sujitha, J. John, and A. Vijayan, “The forcing edge-to-vertex geodetic number of a graph”, International journal of pure and applied mathematics,...
  • V. R. Sunil Kumar and J. John, “The total detour domination number of a graph”, Infokara research, vol. 8, no. 8, pp. 434-440, 2019. [On line]....
  • F-H. Wang , Y-L. Wang, and J-M. ChangJ, “The lower and upper forcing geodetic numbers of blockcactus graphs”, European journal of operational...
  • M. Yannakakis and F. Gavril, “Edge dominating sets in graphs”, SIAM journal on applied mathematics, vol. 38, no. 3, pp. 364-372, 1980, doi:...