On the product of upper irredundance numbers of a graph and its complement
From MaRDI portal
Publication:1119604
DOI10.1016/0012-365X(89)90304-XzbMath0672.05049MaRDI QIDQ1119604
E. J. Cockayne, Christina M. Mynhardt
Publication date: 1989
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Bibliography on domination in graphs and some basic definitions of domination parameters, The product of the independent domination numbers of a graph and its complement, Lower Ramsey numbers for graphs, On the algorithmic complexity of twelve covering and independence parameters of graphs, Nordhaus--Gaddum bounds for independent domination, On a Nordhaus-Gaddum type problem for independent domination, Irredundance perfect graphs, Independent domination in regular graphs, Upper bounds for independent domination in regular graphs
Cites Work