On minimal geodetic domination in graphs
Ferdinand Paler Jamil, Hearty M. Nuenay · Discussiones Mathematicae Graph Theory · 2015
Let G be a connected graph. For two vertices u and v in G, a u-v geodesic is any shortest path joining u and v. The closed geodetic interval I G [u, v] consists of all vertices of G lying on any u-v geodesic. For