Covering Saturation number of standard graphs

Let be a graph and . Let denote the minimum cardinality of a covering set in which contains . Then

is called the min-max covering saturation number of a graph . Let denote the maximum cardinality of a covering set in which contains . Then

is called the max-min covering saturation number of a graph G. In this paper, we initiate the study of these parameters.