Let $G=(V, E)$ be a simple graph. A set $C$ of vertices $G$ is an identifying set of $G$ if for every two vertices $x$ and $y$ belong to $V$ 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 set of $G$ is called the identifying code number of $G$ and is denoted by $\gamma^{ID}(G).$ Two vertices $x$ and $y$ are twins when $N_{G}[x]=N_{G}[y].$ Graphs with at least two twin vertices are not identifiable graphs. In this paper, we present three bounds for identifying code number.
Vatandoost, E., & Mirasheh, K. (2022). Three Bounds For Identifying Code Number. Journal of Algebra and Related Topics, 10(2), 61-67. doi: 10.22124/jart.2022.20661.1321
MLA
E. Vatandoost; K. Mirasheh. "Three Bounds For Identifying Code Number". Journal of Algebra and Related Topics, 10, 2, 2022, 61-67. doi: 10.22124/jart.2022.20661.1321
HARVARD
Vatandoost, E., Mirasheh, K. (2022). 'Three Bounds For Identifying Code Number', Journal of Algebra and Related Topics, 10(2), pp. 61-67. doi: 10.22124/jart.2022.20661.1321
VANCOUVER
Vatandoost, E., Mirasheh, K. Three Bounds For Identifying Code Number. Journal of Algebra and Related Topics, 2022; 10(2): 61-67. doi: 10.22124/jart.2022.20661.1321
)