Identifying codes and watching systems in Kneser graphs
From MaRDI portal
Publication:2966507
DOI10.1142/S1793830917500070zbMath1358.05058OpenAlexW2556224564MaRDI QIDQ2966507
Hamid Reza Maimani, Maryam Roozbayani
Publication date: 7 March 2017
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830917500070
Related Items (6)
On the watching number of graphs using discharging procedure ⋮ The watching system as a generalization of identifying code ⋮ Progress on fault-tolerant locating-dominating sets ⋮ Unnamed Item ⋮ New results of identifying codes in product graphs ⋮ Minimum identifying codes in some graphs differing by matchings
Cites Work
- Unnamed Item
- Unnamed Item
- 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: Identifying codes and watching systems in Kneser graphs