Let G be a simple, connected, and finite graph. For every vertex v∈ VG, we denote by NG v
the set of neighbours of v in G. The locating-dominating number of a graph G is defined as …

A set of vertices S is called a geodetic-dominating set of G if every vertex outside S is
adjacent to a vertex in S, and also is located inside a shortest path between two vertices in …

Suatu subhimpunan titik 𝐷⊆ 𝑉 (𝐺) merupakan himpunan dominasi jika setiap titik 𝑣∈ 𝑉
(𝐺)\𝐷 memiliki tetangga di 𝐷. Jika setiap titik berbeda 𝑥, 𝑦∈ 𝑉 (𝐺)\𝐷 memiliki himpunan …

Let G be a simple, connected, and finite graph. For every vertex v∈ V (G), we denote by NG
(v) the set of neighbours of v in G. The locating‐dominating number of a graph G is defined …

Research Article On Locating-Dominating Set of Regular Graphs Page 1 Research Article On
Locating-Dominating Set of Regular Graphs Anuwar Kadir Abdul Gafur 1 and Suhadi Wido …