Upper bounds for independent domination in regular graphs

DOI10.1016/j.disc.2007.01.001zbMath1127.05072OpenAlexW2086470485MaRDI QIDQ2455589

Julie Haviland

Publication date: 25 October 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.01.001

zbMATH Keywords

regular graphscomplementIndependent dominationNordhaus-Gaddum bounds

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (9)

The independent domination numbers of strong product of two cycles ⋮ Domination versus independent domination in cubic graphs ⋮ Domination versus independent domination in graphs of small regularity ⋮ On the independent domination number of regular graphs ⋮ Independent dominating sets in triangle-free graphs ⋮ Triangle-free graphs with large independent domination number ⋮ Independent domination in triangle-free graphs ⋮ A structural approach for independent domination of regular graphs ⋮ Independent domination in subcubic graphs

Cites Work

• Two relations between the parameters of independence and irredundance
• 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 minimum maximal independent sets of a graph
• On independent domination number of regular graphs
• An upper bound for the independent domination number
• Nordhaus--Gaddum bounds for independent domination
• On a Nordhaus-Gaddum type problem for independent domination
• Independent domination in regular graphs

This page was built for publication: Upper bounds for independent domination in regular graphs