1. Reducing the maximum degree of a graph by deleting vertices;Borg;Australas. J. Comb.,2017
2. Reducing the maximum degree of a graph by deleting vertices: the extremal cases;Borg;Theory Appl. Graphs,2018
3. k-domination and k-independence in graphs: a survey;Chellali;Graphs Comb.,2012
4. Domination of Undirected Graphs – A Survey;Cockayne,1978
5. Towards a theory of domination in graphs;Cockayne;Networks,1977