English

Independent Sets in Direct Products of Vertex-transitive Graphs

Combinatorics 2010-07-07 v1

Abstract

The direct product G×HG\times H of graphs GG and HH is defined by: V(G×H)=V(G)×V(H)V(G\times H)=V(G)\times V(H) and E(G×H)={[(u1,v1),(u2,v2)]:(u1,u2)E(G)\mbox and (v1,v2)E(H)}.E(G\times 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)\right\}. In this paper, we will prove that the equality α(G×H)=max{α(G)H,α(H)G}\alpha(G\times H)=\max\{\alpha(G)|H|, \alpha(H)|G|\} holds for all vertex-transitive graphs GG and HH, 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 G×HG\times H are determined.

Keywords

Cite

@article{arxiv.1007.0797,
  title  = {Independent Sets in Direct Products of Vertex-transitive Graphs},
  author = {Huajun Zhang},
  journal= {arXiv preprint arXiv:1007.0797},
  year   = {2010}
}

Comments

11 pages