Extremal cubic graphs for fault-tolerant locating domination

DOI10.1016/j.tcs.2022.03.014OpenAlexW4221061638MaRDI QIDQ2143147

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

zbMATH Keywords

densitycubic graphslocating-dominating setsfault-tolerantextremalerror-correctingredundant

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

On redundant locating-dominating sets

Uses Software

• snarkhunter

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Locating-total domination in claw-free cubic graphs
• Open neighborhood locating-dominating in trees
• On a conjecture on total domination in claw-free cubic graphs
• Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
• On locating--dominating sets in infinite grids
• Fault tolerant detectors for distinguishing sets in graphs
• Locating-dominating sets in twin-free graphs
• Location-domination and matching in cubic graphs
• Distance-hereditary graphs
• Fault-tolerant locating-dominating sets
• Tolerant location detection in sensor networks
• Watching systems in graphs: an extension of identifying codes
• Fault-tolerant detectors for distinguishing sets in cubic graphs
• On robust and dynamic identifying codes
• On a new class of codes for identifying vertices in graphs
• The Generation of Fullerenes

This page was built for publication: Extremal cubic graphs for fault-tolerant locating domination