On the independent domination number of regular graphs
From MaRDI portal
Publication:1929752
DOI10.1007/s00026-012-0155-4zbMath1256.05169OpenAlexW2014959271MaRDI QIDQ1929752
Jeremy Lyle, Michael A. Henning, 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
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Cubic graphs with large ratio of independent domination number to domination number ⋮ Bounds on domination parameters in graphs: a brief survey ⋮ New bounds on the independence number of connected graphs ⋮ Independent Domination in Cubic Graphs ⋮ Independent dominating sets in regular graphs ⋮ Conjecture of TxGraffiti: Independence, domination, and matchings ⋮ Independent domination in subcubic graphs of girth at least six ⋮ Domination versus independent domination in cubic graphs ⋮ Domination versus independent domination in graphs of small regularity ⋮ On independent domination of regular graphs ⋮ Domination versus independent domination in regular graphs ⋮ A tight bound for independent domination of cubic graphs without 4‐cycles ⋮ A note on the independent domination number in graphs ⋮ An improved lower bound on the independence number of a graph ⋮ Independent domination number in Cayley digraphs of rectangular groups ⋮ A structural approach for independent domination of regular graphs ⋮ Bounds on the independence number of a graph in terms of order, size and maximum degree ⋮ Independent domination in bipartite cubic graphs ⋮ 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 independent domination in planar cubic graphs ⋮ Independent domination in subcubic graphs ⋮ My Favorite Domination Conjectures in Graph Theory Are Bounded ⋮ An improved upper bound on the independent domination number in cubic graphs of girth at least six
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear programming and the worst-case analysis of greedy algorithms on cubic graphs
- 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?
- Two relations between the parameters of independence and irredundance
- The product of the independent domination numbers of a graph and its complement
- On minimum maximal independent sets of a graph
- On independent domination number of regular graphs
- Disproof of a conjecture in the domination theory
- Nordhaus--Gaddum bounds for independent domination
- On a Nordhaus-Gaddum type problem for independent domination
- Independent domination in regular graphs
- A counterexample to conjecture of Barefoot, Harary, and Jones
- Independent sets in regular graphs
- Upper bounds for independent domination in regular graphs
- On hitting all maximum cliques with an independent set
- Towards a theory of domination in graphs
