Upper Vertex Covering Number and well Covered Semigraphs
D. K. Thakkar, Ashish Amrutlal Prajapati · International Journal of Mathematics and Soft Computing · 2016
Abstract. In this paper, we dened minimal vertex covering sets with maximum cardinality to be bo€€€sets in the given semigraph. We also dened upper vertex covering number of a semigraph.We prove that this number does not increase when a vertex is removed from a semigraph. We also introduce well-covered semigraphs, approximately well covered semigraphs, and proved somerelated results.