Abstract
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph G, denoted by rc(G), is the smallest number of colors that are needed in order to make G rainbow connected. In this paper, we investigate rainbow connection numbers of three subfamilies of undirected double-loop networks, denoted by rc(G(n; ±s 1, ±s 2)), where 1 ≤ s 1 < s 2 < n∕2. We almost determine the precise value for the case that \(s_{1} = 1,s_{2} = 2\). For the case that \(n = ks,s_{1} = 1,s_{2} = s\), where s ≥ 3 and k ≥ 1 are integers, we derive that \(rc(G(ks;\pm 1,\pm s)) \leq \min \{\lceil \frac{k} {2} \rceil + s,\lceil \frac{s+1} {2} \rceil + k - 1\}\). For the case that \(n = 2ks,s_{1} = 2,s_{2} = s\), where k ≥ 1 are integers and s ≥ 3 are odd integers, we have \(rc(G(n;\pm s_{1},\pm s_{2})) \leq \lceil \frac{ks} {2} \rceil + k\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chartrand, G., Johns, G.L., McKeon, K.A., Zhang, P.: Rainbow connection in graphs. Math. Bohem. 133, 85–98 (2008)
Li, X., Sun, Y.: Rainbow Connections of Graphs. SpringerBriefs in Mathematics. Springer, New York (2012)
Li, X., Shi, Y., Sun, Y.: Rainbow connections of graphs–a survey. Graphs Comb. 29(1), 1–38 (2013)
Bermond, J.-C., Comellas, F., Hsu, D.F.: Distributed loop computer networks: a survey. J. Parallel Distrib. Comput. 24, 2–10 (1995)
Hwang, F.K.: A survey on multi-loop networks. Theor. Comput. Sci. 299, 107–121 (2003)
Monakhova, E.A.: A survey on undirected circulant graphs. Discrete Math. Algorithms Appl. 4(1), 1250002 (30 pp.) (2012)
Comellas, F., Mitjana, M., Peters, J.G.: Broadcasting in small-world communication networks. In: 9th Int. Coll. Structural Information and Communication Complexity (SIROCCO 9). Proc. Inform. 13, 73–85 (2002)
Balaban, A.T.: Reaction graphs. In: Bonchev, D., Mekenyan, O. (eds.) Graph Theoretical Approaches to Chemical Reactivity, pp. 137–180. Kluwer Academic, Dordrecht (1994)
Muga, F.P., Yu, W.E.S.: A proposed topology for a 192-processor symmetric cluster with a single-switch delay. In: First Philippine Computing Science Congress, Manila, 10 pp. (2000)
Nesterenko, B.B., Novotarskiy, M.A.: Cellular neural networks with circulant graphs. Artif. Intell. 3, 132–138 (2009) (in Russian)
Narayanan, L., Opatrny, J., Sotteau, D.: All-to-all optical routing in chordal rings of degree four. Algorithmica 31(2), 155–178 (2001)
Martinez, C., Beivide, R., Stafford, E., Moreto, M., Gabidulin, E.M.: Modeling toroidal networks with the Gaussian integers. IEEE Trans. Comput. 57(8), 1046–1056 (2008)
Barnes, G.H., et al.: The Illiac IV computer. IEEE Trans. Comput. 17, 746–757 (1968)
Chen, M.-S., Shin, K.G., Kandlur, D.D.: Addressing, routing, and broadcasting in hexagonal mesh multiprocessors. IEEE Trans. Comput. 39(1), 10–18 (1990)
Dolter, J.W., Ramanathan, P., Shin, K.G.: Performance analysis of virtual cut-through switching in HARTS: a hexagonal mesh multicomputer. IEEE Trans. Comput. 40(6), 669–680 (1991)
Shin, K.G.: HARTS: a distributed real-time architecture. Computer 24(5), 25–35 (1991)
Albader, B., Bose, B., Flahive, M.: Efficient communication algorithms in hexagonal mesh interconnection networks. IEEE Trans. Parallel Distrib. Syst. 23(1), 69–77 (2012)
Thomson, A., Zhou, S.: Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes. European J. Combin. 38, 61–78 (2014)
Thomson, A., Zhou, S.: Frobenius circulant graphs of valency four. J. Aust. Math. Soc. 85, 269–282 (2008)
Chakraborty, S., Fischer, E., Matsliah, A., Yuster, R.: Hardness and algorithms for rainbow connectivity. In: 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, pp. 243–254. Also, see J. Combin. Optim. 21, 330–347 (2011)
Bondy, J.A., Murty, U.S.R.: Graph Theory. Graduate Texts in Mathematics, vol. 244. Springer, New York (2008)
Li, X., Sun, Y.: Rainbow connection numbers of line graphs. Ars Combin. 100, 449–463 (2011)
Li, X., Sun, Y.: Upper bounds for the rainbow connection numbers of line graphs. Graphs Comb. 28, 251–263 (2012)
Boesch, F.T., Tindell, R.: Circulants and their connectivity. J. Graph Theory 8, 487–499 (1984)
Chandran, L.S., Das, A., Rajendraprasad, D., Varma, N.M.: Rainbow connection number and connected dominating sets. J. Graph Theory 71, 206–218 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Sun, Y. (2015). Rainbow Connection Numbers for Undirected Double-Loop Networks. In: Gao, D., Ruan, N., Xing, W. (eds) Advances in Global Optimization. Springer Proceedings in Mathematics & Statistics, vol 95. Springer, Cham. https://doi.org/10.1007/978-3-319-08377-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-08377-3_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08376-6
Online ISBN: 978-3-319-08377-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)