Roman domination with respect to nondegenerate graph properties: vertex and edge removal
- Vladimir Samodivkin
- Australasian J. Combinatorics
For a graphical property P and a graph G, a subset S of vertices of G is a P-set if the subgraph induced by S has the property P . The domination number with respect to the property P , is the minimum cardinality of a dominating P-set. In this paper we present results on changing and unchanging of the domination number with respect to the nondegenerate and hereditary properties when a graph is modified by adding an edge or deleting a vertex.