The diameter of paired-domination vertex critical graphs
In this paper we continue the study of paired-domination in graphs introduced by Haynes and Slater (Networks 32 (1998), 199–206). A paired-dominating set of a graph with no isolated vertex is a dominating set of vertices whose induced subgraph has a perfect matching. The paired-domination number of , denoted by , is the minimum cardinality of a paired-dominating set of . The graph is paired-domination vertex critical if for every vertex of that is not adjacent to a vertex of degree one,...