Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes (Q2186954): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Exact Minimum Density of Codes Identifying Vertices in the Square Grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying and locating-dominating codes on chains and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4659582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying codes and locating-dominating sets on paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying codes of corona product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying codes of lexicographic product of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the size of identifying codes in triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5298903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying codes of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying codes of Cartesian product of two cliques of the same size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3005852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On identifying codes in the Cartesian product of a path and a complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance domination in graphs with given minimum and maximum degree / 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 the size of identifying codes in binary hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal identifying codes in cycles and paths / 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: Q5393489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying Codes and Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3517160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying codes of the direct product of two cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum identifying codes in some Cartesian product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying codes of cycles with odd orders / rank
 
Normal rank

Latest revision as of 22:15, 22 July 2024

scientific article
Language Label Description Also known as
English
Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes
scientific article

    Statements

    Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes (English)
    0 references
    0 references
    0 references
    10 June 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    identifying code
    0 references
    Cartesian product
    0 references
    cycle
    0 references
    path
    0 references
    0 references