Extremal cubic graphs for fault-tolerant locating domination
From MaRDI portal
Publication:2143147
DOI10.1016/J.TCS.2022.03.014OpenAlexW4221061638MaRDI QIDQ2143147FDOQ2143147
Authors: Devin C. Jean, Suk J. Seo 
Publication date: 31 May 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.03.014
Cites Work
- Generation of cubic graphs
- On a new class of codes for identifying vertices in graphs
- On a conjecture on total domination in claw-free cubic graphs
- Distance-hereditary graphs
- Title not available (Why is that?)
- Locating-total domination in claw-free cubic graphs
- Locating-dominating sets in twin-free graphs
- Location-domination and matching in cubic graphs
- Title not available (Why is that?)
- Open neighborhood locating-dominating in trees
- Watching systems in graphs: an extension of identifying codes
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
- Title not available (Why is that?)
- Fault-tolerant locating-dominating sets
- On robust and dynamic identifying codes
- On locating--dominating sets in infinite grids
- Fault tolerant detectors for distinguishing sets in graphs
- Tolerant location detection in sensor networks
- Fault-tolerant detectors for distinguishing sets in cubic graphs
Cited In (1)
Uses Software
This page was built for publication: Extremal cubic graphs for fault-tolerant locating domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2143147)
