Independent domination in regular graphs

DOI10.1016/0012-365X(94)00022-BzbMath0838.05065MaRDI QIDQ1897445

Julie Haviland

Publication date: 27 August 1995

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

zbMATH Keywords

regular graphsindependent domination numberindependent sets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (15)

The independent domination numbers of strong product of two cycles ⋮ VERTEX VULNERABILITY PARAMETER OF GEAR GRAPHS ⋮ ON WEAK DOMINATION NUMBER OF SOME GRAPHS ⋮ Independent dominating sets in regular graphs ⋮ 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 domination in triangle-free graphs ⋮ Upper bounds for independent domination in regular graphs ⋮ Independent domination number in Cayley digraphs of rectangular groups ⋮ A note on the independent domination number of subset graph ⋮ On the algorithmic complexity of twelve covering and independence parameters of graphs ⋮ Independent domination in subcubic graphs ⋮ On independent domination number of regular graphs ⋮ An upper bound for the independent domination number

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 a Nordhaus-Gaddum type problem for independent domination
• Unnamed Item

This page was built for publication: Independent domination in regular graphs