Locating and identifying codes in dihedral graphs

作者：

Highlights：

• The smallest cardinalities of identifying codes and locating codes in dihedral graphs are determined.

• Optimal identifying and locating codes in dihedral graphs are given.

• This is the first step to study these codes in general graphs.

• Combining algebraic graph theory and commination theory in studying codes.

• The method used in this paper provide a new method in studying codes in complex networks.

摘要

•The smallest cardinalities of identifying codes and locating codes in dihedral graphs are determined.•Optimal identifying and locating codes in dihedral graphs are given.•This is the first step to study these codes in general graphs.•Combining algebraic graph theory and commination theory in studying codes.•The method used in this paper provide a new method in studying codes in complex networks.

论文关键词：05B30,05C60

论文评审过程：Received 19 August 2021, Revised 18 October 2021, Accepted 24 October 2021, Available online 7 November 2021, Version of Record 7 November 2021.

论文官网地址：https://doi.org/10.1016/j.amc.2021.126752