Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori (Q1406036): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on identifying codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4948746 / rank
 
Normal rank
Property / cites work
 
Property / cites work: General bounds for identifying codes in some infinite regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum density of an identifying code in the king lattice. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying codes with small radius in some infinite regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Codes Identifying Vertices in the Hexagonal Grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: On codes identifying vertices in the two-dimensional square lattice with diagonals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2717197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On codes identifying sets of vertices in 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: Sequences of optimal identifying codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of optimal codes for strong identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two families of optimal identifying codes in binary Hamming spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4239067 / rank
 
Normal rank

Latest revision as of 10:50, 6 June 2024

scientific article
Language Label Description Also known as
English
Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
scientific article

    Statements

    Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori (English)
    0 references
    0 references
    0 references
    0 references
    9 September 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    closed walks
    0 references
    Lee metric
    0 references