New results of identifying codes in product graphs
作者：
Highlights：
• P.1 L.12 ”if distinct vertices of this graph have distinct closed neighbords” should be ”if distinct vertices of this graph have distinct closed neighborhoods”.
• P. 1 L.19 Instead ”it have been considered and developed” by ”they have been considered and developed”.
• P.2 L.13 ”in their own closed neighbord” should be ”in their own closed neighborhood”.
• P.3 L.6 Instead ”some product graph” by ”some product graphs”.
• P.4 L.22 L.29 ”there exist a vertex” should be ”there exists a vertex”.
• P.6 L.8 Instead ”existes” by ”exists”.
• P.7 L.15 ”This contradict this fact” should be ”This contradicts this fact”.
• P.7 L.28 ”Four possible cases may occurs” should be ”Four possible cases may occur”.
• P.9 L.2 ”Consider the graphs A” shoud be ”Consider the graph A”.
摘要
•P.1 L.12 ”if distinct vertices of this graph have distinct closed neighbords” should be ”if distinct vertices of this graph have distinct closed neighborhoods”.•P. 1 L.19 Instead ”it have been considered and developed” by ”they have been considered and developed”.•P.2 L.13 ”in their own closed neighbord” should be ”in their own closed neighborhood”.•P.3 L.6 Instead ”some product graph” by ”some product graphs”.•P.4 L.22 L.29 ”there exist a vertex” should be ”there exists a vertex”.•P.6 L.8 Instead ”existes” by ”exists”.•P.7 L.15 ”This contradict this fact” should be ”This contradicts this fact”.•P.7 L.28 ”Four possible cases may occurs” should be ”Four possible cases may occur”.•P.9 L.2 ”Consider the graphs A” shoud be ”Consider the graph A”.
论文关键词：Identifying code,Graph products,Domination number
论文评审过程：Received 16 February 2021, Revised 4 June 2021, Accepted 6 June 2021, Available online 23 June 2021, Version of Record 23 June 2021.
论文官网地址：https://doi.org/10.1016/j.amc.2021.126438
