Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes

DOI10.1007/s40819-020-0795-8zbMath1453.05095OpenAlexW3009187292MaRDI QIDQ2186954

N. V. Shinde, B. N. Waphare

Publication date: 10 June 2020

Published in: International Journal of Applied and Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40819-020-0795-8

zbMATH Keywords

cyclepathCartesian productidentifying code

Mathematics Subject Classification ID

Other types of codes (94B60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• On minimum identifying codes in some Cartesian product graphs
• Distance domination in graphs with given minimum and maximum degree
• Identifying codes of the direct product of two cliques
• Identifying codes of corona product graphs
• Identifying codes of cycles
• Identifying Codes and Covering Problems
• 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: Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes