scientific article; zbMATH DE number 7276878

DOI10.22108/toc.2014.4127zbMath1463.05461MaRDI QIDQ5135780

Hamid Reza Maimani, Maryam Roozbayani, Abolfazl Tehranian

Publication date: 24 November 2020

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

identifying codetriangular graphwatching system

Mathematics Subject Classification ID

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

Related Items (3)

On the watching number of graphs using discharging procedure ⋮ Identifying codes and watching systems in Kneser graphs ⋮ Unnamed Item

Cites Work

• On the size of identifying codes in triangle-free graphs
• Extremal cardinalities for identifying and locating-dominating codes in 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.
• Extremal graphs for the identifying code problem
• Watching systems in graphs: an extension of identifying codes
• On a new class of codes for identifying vertices in graphs
• Identifying Codes in Line Graphs

This page was built for publication: