Total proper connection and graph operations

A graph is said to be total-colored if all the edges and vertices of the graph are colored. A path in a total-colored graph is a total proper path if (i) any two adjacent edges on the path differ in color, (ii) any two internal adjacent vertices on the path differ in color, and (iii) any internal vertex of the path differs in color from its incident edges on the path. A total-colored graph is called total-proper connected if any two vertices of the graph are connected by a total proper path of the graph. For a connected graph G, the total proper connection number of G, denoted by tpc(G), is defined as the smallest number of colors required to make G total-proper connected. In this paper, we study the total proper connection number for the graph operations. We find that 3 is the total proper connection number for the join, the lexicographic product and the strong product of nearly all graphs. Besides, we study three kinds of graphs with one factor to be traceable for the Cartesian product as well as the permutation graphs of the star and traceable graphs. The values of the total proper connection number for these graphs are all 3.

[1]  Xuding Zhu,et al.  Game coloring the Cartesian product of graphs , 2008, J. Graph Theory.

[2]  Sandi Klavzar,et al.  Convex Sets in Lexicographic Products of Graphs , 2012, Graphs Comb..

[3]  Yaping Mao,et al.  Proper connection number and graph products , 2015 .

[4]  Hui Jiang,et al.  Upper bounds for the total rainbow connection of graphs , 2016, J. Comb. Optim..

[5]  Ping Zhang,et al.  On proper-path colorings in graphs , 2016 .

[6]  Xueliang Li,et al.  Rainbow Connections of Graphs , 2012 .

[7]  Iztok Peterin,et al.  Rainbow Connection and Graph Products , 2014, Graphs Comb..

[8]  Richard J. Nowakowski,et al.  Small cycle double covers of products I: Lexicographic product with paths and cycles , 2008 .

[9]  Elkin Vumar,et al.  A note on the connectivity of Kronecker products of graphs , 2009, Appl. Math. Lett..

[10]  Xueliang Li,et al.  Proper connection number of random graphs , 2015, Theor. Comput. Sci..

[11]  Henry Liu,et al.  Total rainbow k-connection in graphs , 2014, Discret. Appl. Math..

[12]  F. Harary,et al.  Planar Permutation Graphs , 1967 .

[13]  Yuefang Sun.  On rainbow total-coloring of a graph , 2015, Discret. Appl. Math..

[14]  J. A. Bondy,et al.  Graph Theory , 2008, Graduate Texts in Mathematics.

[15]  Bostjan Bresar,et al.  On the connectivity of the direct product of graphs , 2008, Australas. J Comb..

[16]  Iztok Peterin.  Intervals and Convex Sets in Strong Product of Graphs , 2013, Graphs Comb..

[17]  Zsolt Tuza,et al.  Proper connection of graphs , 2012, Discret. Math..

[18]  Zhao Wang,et al.  Rainbow vertex-connection and graph products , 2016, Int. J. Comput. Math..

[19]  Sandi Klavžar,et al.  ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS , 2008 .

[20]  Ping Zhang,et al.  Characterizations of Graphs Having Large Proper Connection Numbers , 2016, Discuss. Math. Graph Theory.

[21]  Hui Jiang,et al.  On (Strong) Proper Vertex-Connection of Graphs , 2015 .

[22]  Simon Spacapan.  Connectivity of Strong Products of Graphs , 2010, Graphs Comb..

[23]  Xueliang Li,et al.  Rainbow Connections of Graphs: A Survey , 2011, Graphs Comb..