On the independent domination number of regular graphs (Q1929752): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: What is the difference between the domination and independent domination numbers of a cubic graph? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3277097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The product of the independent domination numbers of a graph and its complement / 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: Q4060985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a theory of domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3987051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming and the worst-case analysis of greedy algorithms on cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two relations between the parameters of independence and irredundance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4842744 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus--Gaddum bounds for independent domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum maximal independent sets of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent domination in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for independent domination in regular graphs / 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: The independent domination number of a cubic 3-connected graph can be much larger than its domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On independent domination number of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hitting all maximum cliques with an independent set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326194 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to conjecture of Barefoot, Harary, and Jones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disproof of a conjecture in the domination theory / rank
 
Normal rank

Latest revision as of 02:28, 6 July 2024

scientific article
Language Label Description Also known as
English
On the independent domination number of regular graphs
scientific article

    Statements

    On the independent domination number of regular graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 January 2013
    0 references
    independent domination number
    0 references
    regular graph
    0 references
    cubic graph
    0 references
    independent dominating set
    0 references

    Identifiers