On the watching number of graphs using discharging procedure

DOI10.1007/s12190-020-01482-wzbMath1487.05140OpenAlexW3121484617MaRDI QIDQ2143854

Sheyda Maddah, Modjtaba Ghorbani

Publication date: 31 May 2022

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-020-01482-w

zbMATH Keywords

generalized Petersen graphidentifying codewatching system

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (1)

New results of identifying codes in product graphs

Cites Work

• Unnamed Item
• Maximum size of a minimum watching system and the graphs achieving the bound
• On domination numbers of graphs bundles
• Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
• The watching system as a generalization of identifying code
• Watching systems in the King grid
• Watching systems in graphs: an extension of identifying codes
• Identifying codes and watching systems in Kneser graphs
• Linear system reduction using approximate moment matching
• On a new class of codes for identifying vertices in graphs
• Complexity of Roman {2}-domination and the double Roman domination in graphs
• On some aspects of the generalized Petersen graph

This page was built for publication: On the watching number of graphs using discharging procedure