Abstract
Vertex cover is important to solve problems in developing and organizing intercommunication framework. A set of vertices of a graph is called a vertex cover, if this set covers all the edges in a graph. The minimum cardinality of such a set is called the covering number. In this paper, characterizations for a graph to possess inverse vertex covers are presented. Furthermore, the connection between well-covered graphs and different kinds of perfect graphs with invertibility is given.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
