UPPER VERTEX COVERING NUMBER OF A GRAPH
D. K. Thakkar, Ashish Amrutlal Prajapati, J. V. Changela · 2014
In this paper we consider upper vertex covering sets of a graph and its upper vertex covering number. We prove that upper vertex covering number of a graph does not increase when a vertex is removed from the graph. We also prove necessary and sufficient condition in which this number does not changed. We also consider well covered graphs and prove some interesting results. We further prove that if is approximately well dominated graph then is either well covered or is approximately well covered.