Strong Geodetic Domination of Graphs
D. Antony Xavier1, Deepa Mathew2, Santiagu Theresal3
1D.AntonyXaveir, Department of Mathematics, Loyola College, Chennai.. Affiliated to University of Madras, India.
2Deepa Mathew, Department of Mathematics, Loyola College, Chennai Affiliated to University of Madras, India.
3Santiagu Theresal, Department of Mathematics, Loyola College, Chennai.. Affiliated to University of Madras, India.
Manuscript received on September 16, 2019. | Revised Manuscript received on 24 September, 2019. | Manuscript published on October 10, 2019. | PP: 82-89 | Volume-8 Issue-12, October 2019. | Retrieval Number: L25031081219/2019©BEIESP | DOI: 10.35940/ijitee.L2503.1081219
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: 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.
Keywords: Strong Geodetic, Geodetic Domination Problem, NP-Completeness.
Scope of the Article: Graph Algorithms and Graph Drawing