Minimum sizes of identifying codes in graphs differing by one vertex (Q2392684): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s12095-012-0078-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4244127482 / 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: Structural properties of twin-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum sizes of identifying codes in graphs differing by one edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Identifiable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal cardinalities for identifying and locating-dominating codes in graphs / 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: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs for the identifying code problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3534283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs having a \(V\setminus \{x\}\) set as an identifying code / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal edge-robust identifying code in the triangular lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3412137 / 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 a new class of codes for identifying vertices in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5437393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating sensors in paths and cycles: the case of 2-identifying codes / rank
 
Normal rank

Latest revision as of 16:43, 6 July 2024

scientific article
Language Label Description Also known as
English
Minimum sizes of identifying codes in graphs differing by one vertex
scientific article

    Statements

    Minimum sizes of identifying codes in graphs differing by one vertex (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 August 2013
    0 references
    graph theory
    0 references
    twin-free graphs
    0 references
    identifiable graphs
    0 references
    identifying codes
    0 references

    Identifiers