Independent domination in directed graphs (Q4957541): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Decycling numbers of random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Nordhaus-Gaddum type problem for independent domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint independent dominating sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum independent dominating sets of random cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Independent Domination Number of Random Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasts in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination, independent domination, and duality in strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independent domination number of graphs with given minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent domination in graphs: A survey and recent results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating the minimum independent dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on connected bipartite graphs having independent domination number half their order. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent rainbow domination of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the independent domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Idomatic partitions of direct products of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4744304 / rank
 
Normal rank

Revision as of 13:39, 26 July 2024

scientific article; zbMATH DE number 7392974
Language Label Description Also known as
English
Independent domination in directed graphs
scientific article; zbMATH DE number 7392974

    Statements

    0 references
    0 references
    0 references
    9 September 2021
    0 references
    dominating set
    0 references
    independent set
    0 references
    independent domination
    0 references
    independent dominating set
    0 references
    idomatic number
    0 references
    Independent domination in directed graphs (English)
    0 references

    Identifiers