Fault-tolerant locating-dominating sets on the infinite tumbling block graph
From MaRDI portal
Publication:6644885
Publication date: 28 November 2024
Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fault tolerant detectors for distinguishing sets in graphs
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- Fault-tolerant locating-dominating sets
- On strongly identifying codes
- Optimal open-locating-dominating sets in infinite triangular grids
- On redundant locating-dominating sets
- On identifying codes
- Graphical parameters for classes of tumbling block graphs
- Domination and location in acyclic graphs
- On a new class of codes for identifying vertices in graphs
- Progress on fault-tolerant locating-dominating sets
- Density of identifying codes of hexagonal grids with finite number of rows
This page was built for publication: Fault-tolerant locating-dominating sets on the infinite tumbling block graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6644885)
