News
Let 𝐺 = (𝑉, 𝐸) be a connected graph. A locating-total dominating set in a graph 𝐺 is a total dominating set 𝑆 of a 𝐺, for every pair of vertices 𝑖, 𝑗∈ 𝑉(𝐺) \ 𝑆, such that 𝑁(𝑖) ∩𝑆 = ≠ ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results