Maximum Independent Sets in Direct Products of Cycles or Trees with Arbitrary Graphs

Abstract The direct product of graphs G = (V (G),E(G)) and H = (V (H),E(H)) is the graph, denoted as G×H, with vertex set V (G×H) = V (G)×V (H), where vertices (x1, y1) and (x2, y2) are adjacent in G × H if x1x2 ∈ E(G) and y1y2 ∈ E(H). Let n be odd and m even. We prove that every maximum independent set in Pn×G, respectively Cm×G, is of the form (A×C)∪(B× D), where C and D are nonadjacent in G, and A∪B is the bipartition of Pn respectively Cm. We also give a characterization of maximum independent subsets of Pn × G for every even n and discuss the structure of maximum independent sets in T × G where T is a tree.

[1]  Xuding Zhu,et al.  The fractional version of Hedetniemi's conjecture is true , 2011, Eur. J. Comb..

[2]  Douglas F. Rall,et al.  On the independence number of the Cartesian product of caterpillars , 2001, Ars Comb..

[3]  Jun Wang,et al.  Structure of independent sets in direct products of some vertex-transitive graphs , 2012 .

[4]  Z. Huajun.  Primitivity and Independent Sets in Direct Products of Vertex-Transitive Graphs , 2010, 1007.0655.

[5]  Sandi Klavzar.  Some new bounds and exact results on the independence number of Cartesian product graphs , 2005, Ars Comb..

[6]  Louis M. Friedler.  The Independence Number of the Cartesian Product of Graphs , 2011, Ars Comb..

[7]  L. Lovász,et al.  Applications of product colouring , 1974 .

[8]  Claude Tardif,et al.  Graph products and the chromatic difference sequence of vertex-transitive graphs , 1998, Discret. Math..

[9]  Pranava K. Jha.  Further Results on Independence in Direct-Product Graphs , 2000, Ars Comb..

[10]  Pranava K. Jha,et al.  Independence in Direct-Product Graphs , 1998, Ars Comb..

[11]  T. Sitthiwirattham,et al.  Independent and Vertex Covering Number on Kronecker Product of Km , n , 2011 .

[12]  Sevak H. Badalyan,et al.  On the independence number of the strong product of cycle-powers , 2013, Discret. Math..

[13]  Sandi Klavzar,et al.  On independence numbers of the cartesian product of graphs , 1996, Ars Comb..

[14]  Simon Spacapan.  The k-independence number of direct products of graphs and Hedetniemi's conjecture , 2011, Eur. J. Comb..

[15]  Claude Tardif,et al.  Projectivity and independent sets in powers of graphs , 2002, J. Graph Theory.

[16]  Mario Valencia-Pabon,et al.  Independence and coloring properties of direct products of some vertex-transitive graphs , 2006, Discret. Math..

[17]  A. Klobucar.  Independent sets and independent dominating sets in the strong product of paths and cycles , 2005 .

[18]  Ghidewon Abay-Asmerom,et al.  Notes on the independence number in the Cartesian product of graphs , 2011, Discuss. Math. Graph Theory.

[19]  Xuding Zhu.  A SURVEY ON HEDETNIEMI'S CONJECTURE , 1998 .

[20]  Huajun Zhang,et al.  Independent sets in direct products of vertex-transitive graphs , 2010, J. Comb. Theory, Ser. B.

[21]  Danilo Korze,et al.  A note on the independence number of strong products of odd cycles , 2012, Ars Comb..

[22]  N. Alon,et al.  Graph Products, Fourier Analysis and Spectral Techniques , 2004 .