[1] S. Ahmadi, E. Vatandoost and A. Behtoie, Domination number and identifying code number of the subdivision graphs, J. Algebr. Syst., 13 no. 2 (2025) 1–11
[2] F. Foucaud, S. Gravier, R. Naserasr, A. Parreau and P. Valicov, Identifying codes in line graphs, J. Graph Theory, 73 no. 4 (2013) 425–448.
[3] F. Foucaud and G. Perarnau, Bounds for identifying codes in terms of degree parameters, Electron. J. Combin., 19 no. 1 (2012) Paper 32, 28 pp.
[4] O. Hudry and A. Lobstein, Unique (optimal) solutions: complexity results for identifying and locating-dominating codes, Theoret. Comput. Sci., 767 (2019) 83–102.
[5] M. Roozbayani and H. R. Maimani, Identifying codes and watching systems in Kneser graphs, Discrete Math. Algorithms Appl., 9 no. 1 (2017) 9 pp.
[6] D. F. Rall and K. Wash, Identifying codes of the direct product of two cliques, European J. Combin., 36 (2014) 159–171.
[7] A. Shaminejad, E. Vatandoost and K. Mirasheh, The identifying code number and Mycielski’s construction of graphs, Trans. Comb., 11 no. 4 (2022) 309–316.
)