Open AccessStrong Geodetic Domination of Graphs
Author(s) -
D.Antony Xaveir*,
Deepa Mathew,
Santiagu Theresal
Publication year - 2019
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.l2503.1081219
Subject(s) - geodetic datum , bipartite graph , chordal graph , geodesic , mathematics , combinatorics , graph , geodesy , geography , geometry
The problem to find a where all points of the graph are covered by a unique fixed geodesic between the pair of points in is called the strong geodetic problem. Here the domination concept is combined with strong geodetic concept resulting in Strong geodetic domination of graphs and few results are derived. Also the computational complexity part of this concept with respect to general, chordal, bipartite, chordal- bipartite graphs are explained.