The binary locating-dominating number of some convex polytopes
From MaRDI portal
Publication:4604525
DOI10.26493/1855-3974.973.479zbMath1388.05144OpenAlexW2613706597WikidataQ129358859 ScholiaQ129358859MaRDI QIDQ4604525
Milena Bogdanović, Ana Simić, Jelisavka Milošević
Publication date: 26 February 2018
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/1855-3974.973.479
Applications of graph theory (05C90) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (5)
Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications ⋮ Total Roman domination on the digraphs ⋮ On the binary locating-domination number of regular and strongly-regular graphs ⋮ Binary locating-dominating sets in rotationally-symmetric convex polytopes ⋮ The open-locating-dominating number of some convex polytopes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- LD-graphs and global location-domination in bipartite graphs
- Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
- On families of convex polytopes with constant metric dimension
- Open neighborhood locating-dominating in trees
- Identifying codes and locating-dominating sets on paths and cycles
- On locating--dominating sets in infinite grids
- Extremal cardinalities for identifying and locating-dominating codes in 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
- Locating-dominating sets and identifying codes in graphs of girth at least 5
- On the ensemble of optimal dominating and locating-dominating codes in a graph
- An optimal locating-dominating set in the infinite triangular grid
- Locating and total dominating sets in trees
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension
- Identifying and Locating–Dominating Codes in (Random) Geometric Networks
- Domination and location in acyclic graphs
- Identifying and locating-dominating codes: NP-completeness results for directed graphs
- New variable neighbourhood search based 0-1 MIP heuristics
This page was built for publication: The binary locating-dominating number of some convex polytopes
