On a Nordhaus-Gaddum type problem for independent domination

DOI10.1016/0012-365X(94)00202-TzbMath0820.05039OpenAlexW2018411871MaRDI QIDQ1842161

E. J. Cockayne, Christina M. Mynhardt, Gerd H. Fricke

Publication date: 17 April 1995

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00202-t

zbMATH Keywords

independent domination numberNordhaus-Gaddum type problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (9)

Independent domination in directed graphs ⋮ Independent domination in regular graphs ⋮ Nordhaus-Gaddum bounds for upper total domination ⋮ On the independent domination number of regular graphs ⋮ Nordhaus--Gaddum bounds for independent domination ⋮ Upper bounds for independent domination in regular graphs ⋮ On the algorithmic complexity of twelve covering and independence parameters of graphs ⋮ On independent domination number of regular graphs ⋮ An upper bound for the independent domination number

Cites Work

• 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 Complementary Graphs

This page was built for publication: On a Nordhaus-Gaddum type problem for independent domination