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 条
  • [31] Sets of complex unit vectors with few inner products and distance-regular graphs
    Huang, Junbo
    EUROPEAN JOURNAL OF COMBINATORICS, 2014, 41 : 152 - 162
  • [32] Set graphs. IV. Further connections with claw-freeness
    Milanic, Martin
    Tomescu, Alexandru I.
    DISCRETE APPLIED MATHEMATICS, 2014, 174 : 113 - 121
  • [33] On the DISTANCE IDENTIFYING SET Meta-problem and Applications to the Complexity of Identifying Problems on Graphs
    Barbero, Florian
    Isenmann, Lucas
    Thiebaut, Jocelyn
    ALGORITHMICA, 2020, 82 (08) : 2243 - 2266
  • [34] Set graphs. I. Hereditarily finite sets and extensional acyclic orientations
    Milanic, Martin
    Tomescu, Alexandru I.
    DISCRETE APPLIED MATHEMATICS, 2013, 161 (4-5) : 677 - 690
  • [35] A new construction of antipodal distance regular covers of complete graphs through the use of Godsil-Hensel matrices
    Klin, Mikhail
    Pech, Christian
    ARS MATHEMATICA CONTEMPORANEA, 2011, 4 (02) : 205 - 243
  • [36] EDGE NUMBER, MINIMUM DEGREE, MAXIMUM INDEPENDENT SET, RADIUS AND DIAMETER IN TWIN-FREE GRAPHS
    Auger, David
    Charon, Irene
    Honkala, Iiro
    Hudry, Oliver
    Lobstein, Antoine
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2009, 3 (01) : 97 - 114
  • [37] Ternary codes from the strongly regular (45,12,3,3) graphs and orbit matrices of 2-(45,12,3) designs
    Crnkovic, Dean
    Rodrigues, B. G.
    Rukavina, Sanja
    Simcic, Loredana
    DISCRETE MATHEMATICS, 2012, 312 (20) : 3000 - 3010