On the binary locating-domination number of regular and strongly-regular graphs
DOI10.7153/JMI-2023-17-105OpenAlexW4391457262WikidataQ128886584 ScholiaQ128886584MaRDI QIDQ6200320FDOQ6200320
Authors: Sakander Hayat, Asad Khan, Shaohui Wang 
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) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Association schemes, strongly regular graphs (05E30) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- Generalized domination and efficient domination in graphs
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- Vertex domination of generalized Petersen graphs
- On the ensemble of optimal dominating and locating-dominating codes in a graph
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Nordhaus-Gaddum bounds for locating domination
- LD-graphs and global location-domination in bipartite graphs
- Locating and total dominating sets in trees
- Domination and location in acyclic graphs
- Title not available (Why is that?)
- New variable neighbourhood search based 0-1 MIP heuristics
- 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- Title not available (Why is that?)
- Open neighborhood locating-dominating in trees
- Identifying and locating-dominating codes: NP-completeness results for directed graphs
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- On the domination number of generalized petersen graphs \(P(n,2)\)
- The exact domination number of the generalized Petersen graphs
- Fault-tolerant locating-dominating sets
- Metric dimension of Cayley digraphs of split metacyclic groups
- On locating--dominating sets in infinite grids
- On extremal multiplicative Zagreb indices of trees with given domination number
- Optimal Wirelength of Balanced Complete Multipartite Graphs onto Cartesian Product of {Path, Cycle} and Trees
- Binary locating-dominating sets in rotationally-symmetric convex polytopes
- The binary locating-dominating number of some convex polytopes
This page was built for publication: On the binary locating-domination number of regular and strongly-regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6200320)
