On the binary locating-domination number of regular and strongly-regular graphs
From MaRDI portal
Publication:6200320
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)
Recommendations
Cites work
- scientific article; zbMATH DE number 5717189 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 861343 (Why is no real title available?)
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- 2-rainbow domination of generalized Petersen graphs P(n,2)
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Binary locating-dominating sets in rotationally-symmetric convex polytopes
- Domination and location in acyclic graphs
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- Fault-tolerant locating-dominating sets
- Generalized domination and efficient domination in graphs
- Identifying and locating-dominating codes: NP-completeness results for directed graphs
- LD-graphs and global location-domination in bipartite graphs
- Locating and total dominating sets in trees
- Metric dimension of Cayley digraphs of split metacyclic groups
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- New variable neighborhood search based 0-1 MIP heuristics
- Nordhaus-Gaddum bounds for locating domination
- On extremal multiplicative Zagreb indices of trees with given domination number
- On locating--dominating sets in infinite grids
- On the domination number of generalized petersen graphs \(P(n,2)\)
- On the ensemble of optimal dominating and locating-dominating codes in a graph
- Open neighborhood locating-dominating in trees
- Optimal wirelength of balanced complete multipartite graphs onto Cartesian product of \{path, cycle\} and trees
- The binary locating-dominating number of some convex polytopes
- The exact domination number of the generalized Petersen graphs
- Vertex domination of generalized Petersen graphs
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)
