On Locating-Dominating Set of Regular Graphs

Anuwar Kadir Abdul Gafur, Suhadi Wido Saputro and Muhammad Kamran Siddiqui

Journal of Mathematics, 2021, vol. 2021, 1-6

Abstract: Let G be a simple, connected, and finite graph. For every vertex v∈VG, we denote by NGv the set of neighbours of v in G. The locating-dominating number of a graph G is defined as the minimum cardinality of W ⊆ VG such that every two distinct vertices u,v∈VG\W satisfies ∅≠NGu∩W≠NGv∩W≠∅. 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.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2021/8147514.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2021/8147514.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:8147514

DOI: 10.1155/2021/8147514

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().