Claim Missing Document
Check
Articles

Found 2 Documents
Search

On locating-dominating number of comb product graphs Aswan Anggun Pribadi; Suhadi Wido Saputro
Indonesian Journal of Combinatorics Vol 4, No 1 (2020)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (171.715 KB) | DOI: 10.19184/ijc.2020.4.1.4

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.
Bilangan Dominasi-Lokasi pada Graf Hasil Kali Operasi Comb Graf Lintasan dan Graf Siklus Aswan Anggun Pribadi; Muhammad Dhani; Anastasia Lia Dwi Prestanti
Indonesian Journal of Applied Mathematics Vol 2 No 2 (2023): Indonesian Journal of Applied Mathematics Vol. 2 No. 2 January Chapter
Publisher : Lembaga Penelitian dan Pengabdian Masyarakat (LPPM), Institut Teknologi Sumatera, Lampung Selatan, Lampung, Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35472/indojam.v2i2.1039

Abstract

Dominating set of graph G is subset D⊆V(G) which for every vertex v∈V(G)\D those vertices has neighbour in D. If for every pairs of vertice x and y their neighbour set different than we called D locating-dominating set. As for the minimum cardinality of possible dominating set of G is called the locating-dominating number of G. We determine the value of the locating-dominating number for comb product path (Pn) and cycle (Cn) graph.