Proof of a conjecture for the identifying codenumber of the subdivision of graphs
نویسندگان
1 Department of Pure Mathematics Faculty of Mathematical Sciences, University of Guilan, P. O. Box 41335-19141, Rasht, Iran
2 Department of Pure Mathematics Faculty of Mathematical Sciences, University of Guilan, P. O. Box 41335-19141, Rasht, Iran
3 Department of Basic Science, Imam Khomeini International University, P. O. Box 34148-96818, Qazvin, Iran
doi
10.22108/toc.2025.143773.2228چکیده
In this paper, it is proved that the identifying code number of the subdivision graph of $G$ is $n$ where $ |V(G)|=n. $This result proves the conjecture posed in [S. Ahmadi, E. Vatandoost and A. Behtoie, Domination number and identifying code number of the subdivision graphs, J. Algebr. Syst., 13 no. 2 (2025) pp. 1--11].
