On a new class of identifying codes in graphs (Q845971): Difference between revisions

From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710461151948
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2006.11.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046463303 / rank
 
Normal rank
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: 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: Q4342497 / 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: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the identification of sets of points in the square lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On identification in the triangular grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes for identification in the king lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Identifying Codes in the Triangular and Square Grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On identifying codes in the hexagonal mesh / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the density of identifying codes in the square lattice / 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: Q3684148 / 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: Q3803159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant locating-dominating sets / rank
 
Normal rank

Revision as of 09:59, 2 July 2024

scientific article
Language Label Description Also known as
English
On a new class of identifying codes in graphs
scientific article

    Statements

    On a new class of identifying codes in graphs (English)
    0 references
    0 references
    0 references
    29 January 2010
    0 references
    fault tolerance
    0 references
    parallel processing
    0 references
    identification
    0 references
    optimal code
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references