The identifying code number and Mycielski's construction of graphs
Let $G=(V, E)$ be a simple graph. A set $C$ of vertices $G$ is an identifying code of $G$ if for every two vertices $x$ and $y$ the sets $N_{G} [x] \cap C$ and $N_{G} [y] \cap C$ are non-empty and different. Given a graph $G,$ the smallest size of an identifying code of $G$ is called the identifying...
| Published in: | Transactions on Combinatorics |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2022-12-01
|
| Subjects: | |
| Online Access: | https://toc.ui.ac.ir/article_26088_858b032cc710d026f084d95cbe679621.pdf |