An Upper Bound of the Rainbow Connection Number in RTCC Pyramids
Rainbow connection number of a connected graph G is the minimum number of colors needed to color the edges of G, so that every pair of vertices is connected by at least one path whose edges have distinct colors. In this paper, we propose an upper bound to the size of the rainbow connection number in Recursive Transpose-Connected 4-Cycles (RTCC) pyramids.
KeywordsGraph theory rainbow connection number rainbow coloring RTCC pyramids
Unable to display preview. Download preview PDF.
- 1.Ahadi, A., Dehghan, A.: On Rainbow Connection of Strongly Regular Graphs. Arxiv preprint arXiv:1001.3413v1 [math.CO] (2010)Google Scholar
- 2.Basavaraju, M., Chandran, L.S., Rajendraprasad, D., Ramaswamy, A.: Rainbow Connection Number and Radius. Arxiv preprint arXiv:1011.0620v1 [math.CO] (2010)Google Scholar
- 6.Ericksen, A.: A Matter of Security. Graduating Engineer & Computer Careers, 24–28 (2007)Google Scholar
- 7.Kourdy, R., Rad, M.R.N.: RTCC-Pyramid-NOC: Scalable, Regular and Symmetric Network-on-chip Topology. The Journal of Computing 4, 58–64 (2012)Google Scholar
- 9.Li, X., Shi, Y.: Rainbow Connection in 3-connected Graphs. Arxiv preprint arXiv:1010.6131v1 [math.CO] (2010)Google Scholar
- 10.Li, X., Sun, Y.: Rainbow Connection of Graphs–A Survay, arXiv:1101.5747v1 [math.CO] (2011)Google Scholar
- 12.Wang, F.H., Sung, G.S.: Rainbow Connection Number in Triangular Pyramids. In: 29th Workshop on Combinatorial Mathematics and Computation Theory, Taipei, Taiwan (2012)Google Scholar