On the ensemble of optimal identifying codes in a twin-free graph (Q267807): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s12095-015-0148-3 / rank
Normal rank
 
Property / author
 
Property / author: Iiro S. Honkala / rank
 
Normal rank
Property / author
 
Property / author: Antoine C. Lobstein / 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.1007/s12095-015-0148-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1456675268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs where every k-subset of vertices is an identifying set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of optimal identifying codes in a twin-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ensemble of optimal dominating and locating-dominating codes in a graph / 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: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced subgraphs of Johnson graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \((r,\leq 2)\)-locating-dominating codes in the infinite King grid / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S12095-015-0148-3 / rank
 
Normal rank

Latest revision as of 12:55, 9 December 2024

scientific article
Language Label Description Also known as
English
On the ensemble of optimal identifying codes in a twin-free graph
scientific article

    Statements

    On the ensemble of optimal identifying codes in a twin-free graph (English)
    0 references
    0 references
    0 references
    0 references
    11 April 2016
    0 references
    twin-free graphs
    0 references
    identifiable graphs
    0 references
    identifying codes
    0 references
    Johnson graphs
    0 references
    Johnson induced subgraphs
    0 references

    Identifiers