Open AccessGeodetic Global Domination in the Join of Two Graphs
Author(s) -
X. Lenin Xaviour,
S. Robinson Chellathurai
Publication year - 2020
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.e6770.018520
Subject(s) - geodetic datum , dominating set , vertex (graph theory) , combinatorics , join (topology) , mathematics , graph , discrete mathematics , geography , geodesy
A set S of vertices in a connected graph is called a geodetic set if every vertex not in lies on a shortest path between two vertices from . A set of vertices in is called a dominating set of if every vertex not in has at least one neighbor in . A set is called a geodetic global dominating set of if is both geodetic and global dominating set of . The geodetic global dominating number is the minimum cardinality of a geodetic global dominating set in . In this paper we determine the geodetic global domination number of the join of two graphs.