On the independent domination number of regular graphs
From MaRDI portal
Publication:1929752
DOI10.1007/S00026-012-0155-4zbMATH Open1256.05169OpenAlexW2014959271MaRDI QIDQ1929752FDOQ1929752
Authors: Michael A. Henning, Jeremy Lyle, Justin Southey, Wayne Goddard 
Publication date: 9 January 2013
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://aquila.usm.edu/cgi/viewcontent.cgi?article=8741&context=fac_pubs
Recommendations
- On independent domination number of regular graphs
- On independent domination of regular graphs
- Independent domination in regular graphs
- On the Independent Domination Number of Random Regular Graphs
- On domination and independence numbers of graphs
- scientific article; zbMATH DE number 734465
- A note on the independent domination number in graphs
- Domination versus independent domination in regular graphs
- Upper bounds for independent domination in regular graphs
- Independent dominating sets in regular graphs
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Towards a theory of domination in graphs
- Two relations between the parameters of independence and irredundance
- On independent domination number of regular graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The independent domination number of a cubic 3-connected graph can be much larger than its domination number
- What is the difference between the domination and independent domination numbers of a cubic graph?
- On minimum maximal independent sets of a graph
- Independent domination in regular graphs
- Independent sets in regular graphs
- Linear programming and the worst-case analysis of greedy algorithms on cubic graphs
- Disproof of a conjecture in the domination theory
- A counterexample to conjecture of Barefoot, Harary, and Jones
- Upper bounds for independent domination in regular graphs
- On hitting all maximum cliques with an independent set
- Nordhaus--Gaddum bounds for independent domination
- Title not available (Why is that?)
- The product of the independent domination numbers of a graph and its complement
- On a Nordhaus-Gaddum type problem for independent domination
- Title not available (Why is that?)
Cited In (33)
- Conjectures of TxGraffiti: independence, domination, and matchings
- My favorite domination conjectures in graph theory are bounded
- Bounds on the independence number of a graph in terms of order, size and maximum degree
- An improved upper bound on the independent domination number in cubic graphs of girth at least six
- On the independent domination number of the generalized Petersen graphs
- A tight bound for independent domination of cubic graphs without 4‐cycles
- Cubic graphs with large ratio of independent domination number to domination number
- On independent domination of regular graphs
- Domination versus independent domination in cubic graphs
- Independent domination of graphs with bounded maximum degree
- Title not available (Why is that?)
- Independent domination number in Cayley digraphs of rectangular groups
- On the ratio of the domination number and the independent domination number in graphs
- Independent domination in subcubic bipartite graphs of girth at least six
- On the Independent Domination Number of Random Regular Graphs
- Independent domination in graphs: A survey and recent results
- Independent domination in some wheel related graphs
- Bounds on domination parameters in graphs: a brief survey
- Independent domination in subcubic graphs
- An improved lower bound on the independence number of a graph
- A note on the independent domination number of subset graph
- Independent domination in cubic graphs
- Independent domination in bipartite cubic graphs
- Independent set dominating sets in bipartite graphs
- Graphs with equal domination and independent domination number
- Domination versus independent domination in regular graphs
- Independent dominating sets in regular graphs
- On independent domination in planar cubic graphs
- A structural approach for independent domination of regular graphs
- Domination versus independent domination in graphs of small regularity
- New bounds on the independence number of connected graphs
- A note on the independent domination number in graphs
- Independent domination in subcubic graphs of girth at least six
This page was built for publication: On the independent domination number of regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1929752)
