Worst-case efficient dominating sets in digraphs (Q1949100): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1221422
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2012.11.016 / rank
Normal rank
 
Property / author
 
Property / author: Italo Jose Dejter / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973259076 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1201.1728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A group-theoretic model for symmetric interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4388201 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect codes in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint Hamilton cycles in the star graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient dominating sets in Cayley graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian-laceability of star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect codes over graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2012.11.016 / rank
 
Normal rank

Latest revision as of 14:58, 16 December 2024

scientific article
Language Label Description Also known as
English
Worst-case efficient dominating sets in digraphs
scientific article

    Statements

    Worst-case efficient dominating sets in digraphs (English)
    0 references
    25 April 2013
    0 references
    Cayley graph
    0 references
    star graph
    0 references
    digraph
    0 references
    efficient dominating set
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references