Abstract
Three numerical invariants of graphs—the independence number, the cliquecovering number, and the Rosenfeld number—are studied in relation to themselves and to the strong product of two graphs. Applications are made to limiting values, such as capacity. Some constructions exhibit the independence number of the strong product C m ⊗ C n of odd cycles and of higher (strong) powers C m k of certain odd cycles C m .
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.
