On the ensemble of optimal dominating and locating-dominating codes in a graph (Q2346565): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1016/j.ipl.2015.04.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093832088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Johnson graphs are Hamilton-connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615282 / 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: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ensemble of optimal identifying codes in a twin-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced subgraphs of Johnson graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684148 / rank
 
Normal rank

Latest revision as of 03:41, 10 July 2024

scientific article
Language Label Description Also known as
English
On the ensemble of optimal dominating and locating-dominating codes in a graph
scientific article

    Statements

    On the ensemble of optimal dominating and locating-dominating codes in a graph (English)
    0 references
    0 references
    0 references
    0 references
    2 June 2015
    0 references
    combinatorial problems
    0 references
    domination
    0 references
    locating-dominating codes
    0 references
    Johnson graphs
    0 references

    Identifiers