The product of the independent domination numbers of a graph and its complement
From MaRDI portal
Publication:1179268
DOI10.1016/0012-365X(91)90151-QzbMath0736.05068MaRDI QIDQ1179268
Hao Li, E. J. Cockayne, Gary MacGillivray, Odile Favaron
Publication date: 26 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
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, Relations between the lower domination parameters and the chromatic number of a graph., On a Nordhaus-Gaddum type problem for independent domination, Independent domination in regular graphs, Upper bounds for independent domination in regular graphs
Cites Work
- Unnamed Item
- Bibliography on domination in graphs and some basic definitions of domination parameters
- On the product of upper irredundance numbers of a graph and its complement
- Contributions to the theory of domination, independence and irredundance in graphs
- On Complementary Graphs
- Domination-balanced graphs