Indonesian Journal of CombinatoricsVol 4, No 1 (2020)
On locating-dominating number of comb product graphs
Aswan Anggun Pribadi(Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung) Suhadi Wido Saputro(Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung)
Article Info
Publish Date 28 Jun 2020
Abstract
We consider a set D ⊆ V(G) which dominate G and for every two distinct vertices x, y ∈ V(G) \ D, the open neighborhood of x and y in D are different. The minimum cardinality of D is called the locating-dominating number of G. In this paper, we determine an exact value of the locating- dominating number of comb product graphs of any two connected graphs of order at least two.
Indonesian Journal of Combinatorics (IJC) publishes current research articles in any area of combinatorics and graph theory such as graph labelings, optimal network problems, metric dimension, graph coloring, rainbow connection and other related topics.
IJC is published by the Indonesian ...