Open AccessThe edge-to-edge geodetic domination number of a graph
Author(s) -
J. John,
V. Sujin Flower
Publication year - 2021
Publication title -
proyecciones
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.226
H-Index - 12
eISSN - 0717-6279
pISSN - 0716-0917
DOI - 10.22199/issn.0717-6279-4057
Subject(s) - mathematics , geodetic datum , combinatorics , graph , connectivity , enhanced data rates for gsm evolution , dominating set , cardinality (data modeling) , discrete mathematics , geodesy , computer science , vertex (graph theory) , geography , telecommunications , data mining
Let G = (V, E) be a connected graph with at least three vertices. A set S ⊆ E(G) 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. Some general properties satisfied by this concept are studied. Connected graphs of size m with edge-to-edge geodetic domination number 2 or m or m − 1 are characterized. We proved that if G is a connected graph of size m ≥ 4 and Ḡ is also connected, then 4 ≤ γgee(G) + γgee(Ḡ) ≤ 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, 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.