Abstract
The watching system, as a generalization of identifying code, has been defined by Auger in 2010. The identifying code has been used to wireless networks and it has been also applied to locate objects in the sensor networks. On the other hand, the graph product is employed in most of the mathematic branches such as network design to study the structure of network elements. In this paper, we give some upper bounds for the watching number of well-know product graphs.
Original language | English |
---|---|
Article number | 125302 |
Number of pages | 7 |
Journal | Applied Mathematics and Computation |
Volume | 380 |
DOIs | |
Publication status | Published - 2020 |
Publication type | A1 Journal article-refereed |
Keywords
- Domination number
- Graph products
- Identifying code
- Watching system
Publication forum classification
- Publication forum level 1
ASJC Scopus subject areas
- Computational Mathematics
- Applied Mathematics