Locating and liar domination of circulant networks.

zbMATH Open1265.05467MaRDI QIDQ2918554FDOQ2918554

Authors: Paul Manuel 

Publication date: 8 October 2012

Published in: Ars Combinatoria (Search for Journal in Brave)

Recommendations

• Liar's domination
• Liar's domination in graphs
• scientific article; zbMATH DE number 5533277
• Fault-tolerant locating-dominating sets
• Liar's domination in ladders

zbMATH Keywords

locating-dominating setcirculant networkdominating set in graph theoryliar dominating set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (3)

• Optimal bounds on codes for location in circulant graphs
• Open locating-dominating sets in circulant graphs
• Liar's domination in Sierpinski-like graphs

This page was built for publication: Locating and liar domination of circulant networks.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2918554)