Rainbow connection in brick product graphs


  • K. Srinivasa Rao Shri Pillappa College of Engineering, Bengaluru, India
  • R. Murali Dr.Ambedkar Institute of Technology, Bengaluru, India
  • S. K. Rajendra Dr.Ambedkar Institute of Technology, Bengaluru, India


Let G be a nontrivial connected graph on which is dened a color-
ing c : E(G) ! f1; 2; ; kg; k 2 N, of the edges of G, where adjacent edges may be colored the same. A path in G is called a rainbow path if no two edges of it are colored the same. G is rainbow connected if G contains a rainbow u


[1] B. Alspach, C.C.Chen and Kevin McAvaney. On a class of Hamiltonian laceable 3-regular graphs. Discrete Mathematics, 151(1-3)(1996), 19-38.

[2] G. Chartrand, G. L. Johns, K. A. McKeon and P. Zhang. Rainbow connection in graphs. Math. Bohem., 133(1)(2008), 85-98.

[3] X. Li, Y. Shi and Y. Sun. Rainbow connection of graphs: a survey. Graphs Combin., 29(1)(2013), 1-38.

[4] X. Li and Y. Sun. Rainbow Connection of Graphs. New York: Springer-Verlag, 2012.

[5] K. Srinivasa Rao and R. Murali. Rainbow critical graphs. Int. J. Comp. Appl., 4(4)(2014), 252-259.

[6] K. Srinivasa Rao, R. Murali and S. K. Rajendra. Rainbow and strong rainbow criticalness of some standard graphs. Int. J. Math. Comp. Research, 3(1)(2015), 829-836