Upper vertex covering number and well covered semigraphs

In this paper, we define minimal vertex covering sets with maximum cardinality in the given semigraph and the 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 some related results.