Abstract
Relationships between the following graph invariants are studied: The node clique cover number, θ 0(> G); the clique cover number θ 1( G); node independence number, β 0( G); and an edge independence number, β′ 1( G), We extend a theorem of Choudum, Parthasarathy and Ravindra with further statements equivalent to θ 0( G) = θ 1( G). More general results regarding the inequality θ 0( G) ⩽ 0 1( G) are presented.
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.
