Locating and identifying codes in dihedral graphs

DOI10.1016/j.amc.2021.126752OpenAlexW3213535845MaRDI QIDQ2060210

Shu Jiao Song, Xingtian Ning, Panpan Cheng

Publication date: 13 December 2021

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2021.126752

Mathematics Subject Classification ID

Other designs, configurations (05B30) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Optimal identifying codes of two families of Cayley graphs

Cites Work

• Unnamed Item
• On \((r,\leq 2)\)-locating-dominating codes in the infinite King grid
• On identifying codes in binary Hamming spaces
• Identifying and locating-dominating codes on chains and cycles
• New results of identifying codes in product graphs
• Locating and identifying codes in circulant networks
• On a new class of codes for identifying vertices in graphs
• Exact Minimum Density of Codes Identifying Vertices in the Square Grid

This page was built for publication: Locating and identifying codes in dihedral graphs