Monotonicity of the minimum cardinality of an identifying code in the hypercube (Q2492191): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4948746 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounds on identifying codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On identifying codes in binary Hamming spaces / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a new class of codes for identifying vertices in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the covering of vertices for fault diagnosis in hypercubes / rank | |||
Normal rank |
Latest revision as of 15:36, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Monotonicity of the minimum cardinality of an identifying code in the hypercube |
scientific article |
Statements
Monotonicity of the minimum cardinality of an identifying code in the hypercube (English)
0 references
9 June 2006
0 references
identifying codes
0 references
hypercube
0 references