Independent domination in regular graphs
From MaRDI portal
Publication:1897445
Recommendations
Cites work
- scientific article; zbMATH DE number 3477211 (Why is no real title available?)
- On a Nordhaus-Gaddum type problem for independent domination
- On minimum maximal independent sets of a graph
- On the product of upper irredundance numbers of a graph and its complement
- The product of the independent domination numbers of a graph and its complement
- Two relations between the parameters of independence and irredundance
Cited in
(30)- On minimum maximal independent sets of a graph
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- On independent domination number of regular graphs
- An upper bound for the independent domination number
- On a Nordhaus-Gaddum type problem for independent domination
- Independent domination and matchings in graphs
- On the independent domination number of regular graphs
- Irregular independence and irregular domination
- Independent domination in subcubic graphs
- Independent domination in outerplanar graphs
- Domination versus independent domination in graphs of small regularity
- Upper bounds for independent domination in regular graphs
- Regular independent sets
- The independent domination number of random graph
- Vertex vulnerability parameter of gear graphs
- A note on the independent domination number of subset graph
- Independent dominating sets in regular graphs
- Domination versus independent domination in cubic graphs
- Independent domination number in Cayley digraphs of rectangular groups
- Independent domination in directed graphs
- A structural approach for independent domination of regular graphs
- Independent dominating sets in graphs of girth five
- The independent domination numbers of strong product of two cycles
- ON WEAK DOMINATION NUMBER OF SOME GRAPHS
- On independent domination of regular graphs
- Domination versus independent domination in regular graphs
- A note on independent domination ratio of regular graphs
- Independent sets in association schemes
- Domination in 4-regular graphs with girth 3
- Independent domination in triangle-free graphs
This page was built for publication: Independent domination in regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1897445)