Liar's domination (Q3057104): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Peter J. Slater / rank
Normal rank
 
Property / author
 
Property / author: Peter J. Slater / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.20295 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4240607287 / 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: 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: Q4948746 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on identifying codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds for codes identifying vertices in 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: Identifying codes in some subgraphs of the square lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3828043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-located graphs: A collection of well-covered ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes identifying sets of vertices in random networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4329059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating and total dominating sets in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4510800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal locating-dominating set in the infinite triangular grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: On robust and dynamic identifying codes / 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: On identifying codes in the hexagonal mesh / rank
 
Normal rank
Property / cites work
 
Property / cites work: On locating--dominating sets in infinite grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667607 / 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: On the covering of vertices for fault diagnosis in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On robust identification in the square and King grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474243 / 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: On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\) / 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: Liar's domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the identification problems in products of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination and location in acyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant locating-dominating sets / rank
 
Normal rank

Latest revision as of 12:57, 3 July 2024

scientific article
Language Label Description Also known as
English
Liar's domination
scientific article

    Statements

    Liar's domination (English)
    0 references
    0 references
    0 references
    24 November 2010
    0 references
    0 references
    detection
    0 references
    fault-tolerant
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references