FEW MORE RESULTS IN DOMATICALLY CO-CRITICAL GRAPHS
H.B. Walikar, L Sudershan Reddy, Santosh Basapur · Discrete Mathematics Algorithms and Applications · 2013
A graph G is said to be domatically co-critical, if d(G + uv) > d(G), for any two nonadjacent vertices u, v in G. In this paper, we present few more newly found results and list some more open problems for further research.