Independent domination in regular graphs
From MaRDI portal
Publication:1897445
DOI10.1016/0012-365X(94)00022-BzbMATH Open0838.05065MaRDI QIDQ1897445FDOQ1897445
Authors: Julie Haviland 
Publication date: 27 August 1995
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- Two relations between the parameters of independence and irredundance
- On minimum maximal independent sets of a graph
- Title not available (Why is that?)
- 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
- On a Nordhaus-Gaddum type problem for independent domination
Cited In (29)
- Independent domination in outerplanar graphs
- Regular independent sets
- An upper bound for the independent domination number
- Independent dominating sets in graphs of girth five
- On independent domination of regular graphs
- Domination versus independent domination in cubic graphs
- Irregular independence and irregular domination
- ON WEAK DOMINATION NUMBER OF SOME GRAPHS
- Independent domination in triangle-free graphs
- Upper bounds for independent domination in regular graphs
- On a Nordhaus-Gaddum type problem for independent domination
- Independent domination number in Cayley digraphs of rectangular groups
- On independent domination number of regular graphs
- Independent domination and matchings in graphs
- Vertex vulnerability parameter of gear graphs
- Domination in 4-regular graphs with girth 3
- Independent domination in directed graphs
- Independent domination in subcubic graphs
- The independent domination numbers of strong product of two cycles
- The independent domination number of random graph
- A note on the independent domination number of subset graph
- On the independent domination number of regular graphs
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- Domination versus independent domination in regular graphs
- Independent dominating sets in regular graphs
- A structural approach for independent domination of regular graphs
- Domination versus independent domination in graphs of small regularity
- Independent sets in association schemes
- On minimum maximal independent sets of a graph
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)
