共 37 条
On Locating-Dominating Set of Regular Graphs
被引:0
作者:
Gafur, Anuwar Kadir Abdul
[1
]
Saputro, Suhadi Wido
[2
]
机构:
[1] Pasific Morotai Univ, Dept Math, Morotai, Indonesia
[2] Bandung Inst Technol, Dept Math, Bandung, Indonesia
关键词:
CODES;
D O I:
10.1155/2021/8147514
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
Let G be a simple, connected, and finite graph. For every vertex v is an element of V(G), we denote by N-G (v) the set of neighbours of v in G. The locating-dominating number of a graph G is defined as the minimum cardinality of W subset of V(G) such that every two distinct vertices u, v is an element of V(G)\Wsatisfies (sic) N-G (u) boolean AND W dagger N-G (v) boolean AND W dagger(sci). A graph G is called k-regular graph if every vertex of G is adjacent to k other vertices of G. In this paper, we determine the locating-dominating number of k-regular graph of order n, where k = n - 2 or k = n - 3.
引用
收藏
页数:6
相关论文
共 37 条