On the product of upper irredundance numbers of a graph and its complement

DOI10.1016/0012-365X(89)90304-XzbMath0672.05049OpenAlexW2060612181MaRDI QIDQ1119604

E. J. Cockayne, Christina M. Mynhardt

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0012-365x(89)90304-x

zbMATH Keywords

complement of a graphirredundance numberclosed neighbourhood

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (12)

Irredundance perfect graphs ⋮ Independent domination in regular graphs ⋮ Nordhaus-Gaddum bounds for upper total domination ⋮ Nordhaus--Gaddum bounds for independent domination ⋮ Upper bounds for independent domination in regular graphs ⋮ The product of the independent domination numbers of a graph and its complement ⋮ Lower Ramsey numbers for graphs ⋮ Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance ⋮ Irredundance ⋮ On the algorithmic complexity of twelve covering and independence parameters of graphs ⋮ On a Nordhaus-Gaddum type problem for independent domination ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Contributions to the theory of domination, independence and irredundance in graphs
• On Complementary Graphs
• Properties of Hereditary Hypergraphs and Middle Graphs

This page was built for publication: On the product of upper irredundance numbers of a graph and its complement