Fault tolerant detectors for distinguishing sets in graphs (Q891327): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.7151/dmgt.1838 / 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.7151/dmgt.1838 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2578057204 / 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: Q3089301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5442540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On open neighborhood locating-dominating 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: New bounds on the minimum density of an identifying code for the infinite hexagonal grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3090475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Centroidal bases in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3032297 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2869357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum bounds for locating domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5506519 / 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: An optimal strongly identifying code in the infinite triangular grid / 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: On identifying codes that are robust against edge changes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On strongly identifying codes / 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: Optimal open-locating-dominating sets in infinite triangular grids / 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: A linear time algorithm for liar's domination problem in proper interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness results and approximation algorithm for total liar's domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3616664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Liar's domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3581950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3565861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open neighborhood locating-dominating in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2869325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphical parameters for classes of tumbling block graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5405452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2878227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4566243 / 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: Q4871068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant locating-dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Liar's domination / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.7151/DMGT.1838 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:18, 10 December 2024

scientific article
Language Label Description Also known as
English
Fault tolerant detectors for distinguishing sets in graphs
scientific article

    Statements

    Fault tolerant detectors for distinguishing sets in graphs (English)
    0 references
    0 references
    0 references
    17 November 2015
    0 references
    distinguishing sets
    0 references
    fault tolerant detectors
    0 references
    redundant distinguishing open-locating-dominating set
    0 references
    detection distinguishing open-locating-dominating set
    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
    0 references
    0 references

    Identifiers