Abstract
Let Circ(r, n) be a circular graph. It is well known that its independence number α(Circ(r, n)) = r. In this paper we prove that $$\alpha (Circ(r,n) \times H) = \max \{ r|H|,n\alpha (H)\} $$ for every vertex transitive graph H, and describe the structure of maximum independent sets in Circ(r, n) × H. As consequences, we prove $$\alpha (G \times H) = \max \{ \alpha (G)|V(H)|,\alpha (H)|V(G)|\} $$ for G being Kneser graphs, and the graphs defined by permutations and partial permutations, respectively. The structure of maximum independent sets in these direct products is also described.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.