Watching systems of triangular graphs

DOI10.22108/TOC.2014.4127MaRDI QIDQ5135780zbMATH OpenFDO

Authors Maryam Roozbayani, H. R. Maimani, Abolfazl Tehranian

Publication date 24 November 2020

Full work available at URL https://doi.org/10.22108/TOC.2014.4127

zbMATH Keywords

identifying codetriangular graphwatching system

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Maximum size of a minimum watching system and the graphs achieving the bound
• Watching systems in graphs: an extension of identifying codes
• The watching system as a generalization of identifying code
• Identifying codes and watching systems in Kneser graphs
• Watchman's walk of Steiner triple system block intersection graphs

Cites work

• Extremal cardinalities for identifying and locating-dominating codes in graphs
• Extremal graphs for the identifying code problem
• Identifying codes in line graphs
• Minimal identifying codes in trees and planar graphs with large girth
• Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
• On a new class of codes for identifying vertices in graphs
• On the size of identifying codes in triangle-free graphs
• Watching systems in graphs: an extension of identifying codes

Cited in

(7)

• On the watching number of graphs using discharging procedure
• The watching system as a generalization of identifying code
• Identifying codes and watching systems in Kneser graphs
• Watchman's walk of Steiner triple system block intersection graphs
• Maximum size of a minimum watching system and the graphs achieving the bound
• On the watching number of graphs
• Domination number and watching number of subdivision construction of graphs

This page was built for publication: Watching systems of triangular graphs

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