On locating-dominating set of regular graphs

DOI10.1155/2021/8147514zbMath1477.05133OpenAlexW3203414618MaRDI QIDQ2052122

S. W. Saputro, Anuwar Kadir Abdul Gafur

Publication date: 25 November 2021

Published in: Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2021/8147514

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• The difference between the metric dimension and the determining number of a graph
• A polyhedral approach to locating-dominating sets in graphs
• Locating-dominating codes: bounds and extremal cardinalities
• Locating-dominating sets in twin-free graphs
• Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
• On \(k\)-dimensional graphs and their bases
• Locating-dominating sets in hypergraphs
• Identifying and locating-dominating codes on chains and cycles
• The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations
• Locating-dominating sets of functigraphs
• Locating-dominating sets and identifying codes in graphs of girth at least 5
• Locating domination in bipartite graphs and their complements
• Domination and location in acyclic graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: On locating-dominating set of regular graphs