The Inverse Split and Non-split Domination in Graphs

K. Ameenal Bibi, R. Selvakumar · International Journal of Computer Applications · 2010

In this paper, we define the notions of inverse split and non split domination in graphs.We get many bounds on inverse split and non split domination numbers.Nordhaus-Gaddum type results are also obtained for these new parameters.

Read the paper · More papers on PaperTik