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

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
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

Revision as of 10:14, 6 July 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