1. Finite order domination in graphs;Burger;J. Combin. Math. Combin. Comput.,2004
2. Infinite order domination in graphs;Burger;J. Combin. Math. Combin. Comput.,2004
3. Secure domination, weak roman domination and forbidden subgraphs;Cockayne;Bull. Inst. Combin. Appl.,2003
4. Protection of a graph;Cockayne;Utilitas Math.,2005
5. What makes an irredundant set maximal?;Cockayne;J. Combin. Math. Combin. Comput.,1997