Nordhaus--Gaddum bounds for independent domination

Authors:
Wayne Goddard;Michael A. Henning
Affiliations:
Department of Computer Science, University of Natal, Durban 4041, South Africa;School of Mathematics, Statistics and Information Technology, University of Natal, Private Bag X01, Scottsville, Pietermaritzburg 3209, South Africa
Venue:
Discrete Mathematics
Year:
2003

Citing 5
Cited 2

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

Discrete Mathematics
On a Nordhaus-Gaddum type problem for independent domination

Selected papers of the 14th British conference on Combinatorial conference
Nordhaus-Gaddum inequalities for domination in graphs

Discrete Mathematics - Special issue on combinatorics
A note on cliques and independent sets

Journal of Graph Theory
Graphs and Digraphs, Fourth Edition

Graphs and Digraphs, Fourth Edition

Multiple factor Nordhaus-Gaddum type results for domination and total domination

Discrete Applied Mathematics
A survey of Nordhaus-Gaddum type relations

Discrete Applied Mathematics

Quantified Score

Hi-index	0.05

Visualization

Abstract

We establish sharp bonds on the sum and product of the independent domination numbers of a graph and its complement.