Independent sets in direct products of vertex-transitive graphs

From MaRDI portal
Publication:414657

DOI10.1016/J.JCTB.2011.12.005zbMATH Open1251.05130arXiv1007.0797OpenAlexW1974993270MaRDI QIDQ414657FDOQ414657

Hua Jun Zhang

Publication date: 11 May 2012

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Abstract: The direct product GimesH of graphs G and H is defined by: [V(G imes H)=V(G) imes V(H)] and [E(G imes H)=left{[(u_1,v_1),(u_2,v_2)]: (u_1,u_2)in E(G) mbox{ and } (v_1,v_2)in E(H) ight}.] In this paper, we will prove that the equality alpha(G imes H)=max{alpha(G)|H|, alpha(H)|G|} holds for all vertex-transitive graphs G and H, which provides an affirmative answer to a problem posed by Tardif (Discrete Math. 185 (1998) 193-200). Furthermore, the structure of all maximum independent sets of GimesH are determined.


Full work available at URL: https://arxiv.org/abs/1007.0797




Recommendations




Cites Work


Cited In (19)





This page was built for publication: Independent sets in direct products of vertex-transitive graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414657)