On the covering of vertices for fault diagnosis in hypercubes
Information Processing Letters
On Identifying Codes in the Triangular and Square Grids
SIAM Journal on Computing
Identifying and locating-dominating codes on chains and cycles
European Journal of Combinatorics
Exact Minimum Density of Codes Identifying Vertices in the Square Grid
SIAM Journal on Discrete Mathematics
European Journal of Combinatorics
Monotonicity of the minimum cardinality of an identifying code in the hypercube
Discrete Applied Mathematics
Identifying codes of cycles with odd orders
European Journal of Combinatorics
Note: On the size of identifying codes in binary hypercubes
Journal of Combinatorial Theory Series A
Identifying codes and locating-dominating sets on paths and cycles
Discrete Applied Mathematics
On a new class of codes for identifying vertices in graphs
IEEE Transactions on Information Theory
Optimal Identifying Codes in Cycles and Paths
Graphs and Combinatorics
| Hi-index | 0.00 |
An identifying code in a graph is a dominating set that also has the property that the closed neighborhood of each vertex in the graph has a distinct intersection with the set. The minimum cardinality of an identifying code in a graph G is denoted @c^I^D(G). It was recently shown by Gravier, Moncel and Semri that @c^I^D(K"n@?K"n)=@?3n2@?. Letting n,m=2 be any integers, we consider identifying codes of the direct product K"nxK"m. In particular, we answer a question of Klavzar and show the exact value of @c^I^D(K"nxK"m).