Optimal identifying codes of two families of Cayley graphs

DOI10.1016/j.dam.2022.05.023zbMath1495.05127OpenAlexW4282932053MaRDI QIDQ2166227

Min Feng, Li-Hua Feng, Xuan Long Ma

Publication date: 24 August 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2022.05.023

zbMATH Keywords

Cayley graphsgeneralized quaternion groupsidentifying codesinfinite graphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Theory of error-correcting codes and error-detecting codes (94B99) Infinite graphs (05C63)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Identifying codes in some subgraphs of the square lattice
• Identifying codes and locating-dominating sets on paths and cycles
• On identifying codes in binary Hamming spaces
• Identifying codes of cycles with odd orders
• Improved bounds on identifying codes in binary Hamming spaces
• An optimal strongly identifying code in the infinite triangular grid
• Identifying codes of Cartesian product of two cliques of the same size
• On the size of identifying codes in binary hypercubes
• On the identification problems in products of cycles
• The minimum density of an identifying code in the king lattice.
• Identifying codes in the direct product of a complete graph and some special graphs
• Identifying and locating-dominating codes on chains and cycles
• Optimal identifying codes in cycles and paths
• Identifying codes of lexicographic product of graphs
• Locating and identifying codes in dihedral graphs
• On minimum identifying codes in some Cartesian product graphs
• The number of completely different optimal identifying codes in the infinite square grid
• Identifying codes of the direct product of two cliques
• Identifying codes of corona product graphs
• Identifying codes of cycles
• Monotonicity of the minimum cardinality of an identifying code in the hypercube
• Vertex identifying codes for the n-dimensional lattice
• On a new class of codes for identifying vertices in graphs
• On Identifying Codes in the Triangular and Square Grids
• Exact Minimum Density of Codes Identifying Vertices in the Square Grid
• Minimum density of identifying codes of king grids

This page was built for publication: Optimal identifying codes of two families of Cayley graphs