On the binary locating-domination number of regular and strongly-regular graphs
DOI10.7153/jmi-2023-17-105OpenAlexW4391457262WikidataQ128886584 ScholiaQ128886584MaRDI QIDQ6200320
Shaohui Wang, Unnamed Author, Sakander Hayat, Asad Khan
Publication date: 29 February 2024
Published in: Journal of Mathematical Inequalities (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7153/jmi-2023-17-105
Applications of graph theory (05C90) Association schemes, strongly regular graphs (05E30) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- LD-graphs and global location-domination in bipartite graphs
- Open neighborhood locating-dominating in trees
- On locating--dominating sets in infinite grids
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- On the domination number of generalized petersen graphs \(P(n,2)\)
- The exact domination number of the generalized Petersen graphs
- 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
- Vertex domination of generalized Petersen graphs
- Generalized domination and efficient domination in graphs
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- Fault-tolerant locating-dominating sets
- Metric dimension of Cayley digraphs of split metacyclic groups
- On extremal multiplicative Zagreb indices of trees with given domination number
- Binary locating-dominating sets in rotationally-symmetric convex polytopes
- On the ensemble of optimal dominating and locating-dominating codes in a graph
- Nordhaus-Gaddum bounds for locating domination
- Locating and total dominating sets in trees
- Domination and location in acyclic graphs
- The binary locating-dominating number of some convex polytopes
- Identifying and locating-dominating codes: NP-completeness results for directed graphs
- Optimal Wirelength of Balanced Complete Multipartite Graphs onto Cartesian Product of {Path, Cycle} and Trees
- New variable neighbourhood search based 0-1 MIP heuristics
- A theorem on tait colorings with an application to the generalized Petersen graphs
This page was built for publication: On the binary locating-domination number of regular and strongly-regular graphs
