Identifying codes in the direct product of a complete graph and some special graphs
From MaRDI portal
Publication:1720324
DOI10.1016/j.dam.2018.06.027zbMath1404.05182OpenAlexW2887945455MaRDI QIDQ1720324
Publication date: 8 February 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.06.027
Theory of error-correcting codes and error-detecting codes (94B99) Graph operations (line graphs, products, etc.) (05C76)
Related Items (1)
Cites Work
- On identifying codes in the Cartesian product of a path and a complete graph
- On the size of identifying codes in triangle-free graphs
- Identifying codes and locating-dominating sets on paths and cycles
- On identifying codes in binary Hamming spaces
- Identifying codes of cycles with odd orders
- Identifying codes of Cartesian product of two cliques of the same size
- On the size of identifying codes in binary hypercubes
- Identifying and locating-dominating codes on chains and cycles
- Optimal identifying codes in cycles and paths
- Identifying codes of lexicographic product of graphs
- Identifying codes of the direct product of two cliques
- Identifying codes of corona product graphs
- Identifying codes of cycles
- On a new class of codes for identifying vertices in graphs
- Exact Minimum Density of Codes Identifying Vertices in the Square Grid
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Identifying codes in the direct product of a complete graph and some special graphs
