Strong Geodetic Domination of Graphs
2019 ◽
Vol 8
(12)
◽
pp. 82-89
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.
2015 ◽
Vol 30
◽
pp. 21-28
◽
2005 ◽
Vol 145
(3)
◽
pp. 479-482
◽
Keyword(s):
2003 ◽
pp. 111-134
Keyword(s):
2012 ◽
Vol 26
(4)
◽
pp. 770-785
◽
2000 ◽
Vol 99
(1-3)
◽
pp. 427-442
◽
2012 ◽
Vol 04
(03)
◽
pp. 1250045
◽