The following pages link to (Q4948746):
Displayed 24 items.
- On binary linear \(r\)-identifying codes (Q540477) (← links)
- On identifying codes in binary Hamming spaces (Q696908) (← links)
- Identifying codes in vertex-transitive graphs and strongly regular graphs (Q888612) (← links)
- New bounds on binary identifying codes (Q947104) (← links)
- Adaptive identification in graphs (Q958720) (← links)
- Improved bounds on identifying codes in binary Hamming spaces (Q966138) (← links)
- New identifying codes in the binary Hamming space (Q966160) (← links)
- Upper bounds for binary identifying codes (Q1012154) (← links)
- On the size of identifying codes in binary hypercubes (Q1024996) (← links)
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori (Q1406036) (← links)
- On the identification problems in products of cycles (Q1420607) (← links)
- The minimum density of an identifying code in the king lattice. (Q1422415) (← links)
- Optimal codes for strong identification (Q1612759) (← links)
- Paths and cycles identifying vertices in twisted cubes (Q1636884) (← links)
- On the density of identifying codes in the square lattice (Q1850615) (← links)
- Optimal identifying codes of two families of Cayley graphs (Q2166227) (← links)
- New results of identifying codes in product graphs (Q2245049) (← links)
- On minimum identifying codes in some Cartesian product graphs (Q2409538) (← links)
- Identifying codes of the direct product of two cliques (Q2441624) (← links)
- Identifying codes of corona product graphs (Q2449061) (← links)
- Monotonicity of the minimum cardinality of an identifying code in the hypercube (Q2492191) (← links)
- (Q2741420) (← links)
- Liar's domination (Q3057104) (← links)
- Links Between Discriminating and Identifying Codes in the Binary Hamming Space (Q5386104) (← links)