Abstract
Two common invariants of a graph G are its node clique cover number, θ 0( G), and its edge clique cover number, θ 1( G). We present in this work a characterization of those graphs for which they and their complements, G ̄ , have θ 0( G)= θ 1( G) and θ 0( G ̄ )= θ 1( G ̄ ). Graphs satis ying these conditions are shown to constitute a subset of those graphs which we term C-graphs.
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.
