Show simple item record

Rainbow and strong rainbow connection number for some families of graphs

dc.creatorKhan, Yaqoub Ahmed
dc.creatorNaeem, Muhammad
dc.creatorSiddiqui, Muhammad Kamran
dc.creatorFarahani, Mohammad Reza
dc.date2020-07-28
dc.date.accessioned2020-07-29T16:37:59Z
dc.date.available2020-07-29T16:37:59Z
dc.identifierhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/4249
dc.identifier10.22199/issn.0717-6279-2020-04-0046
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/147134
dc.descriptionLet G be a nontrivial connected graph. Then G is called a rainbow connected graph if there exists a coloring c : E(G) ? {1, 2, ..., k}, k ? N, of the edges of G, such that there is a u ? v rainbow path between every two vertices of G, where a path P in G is a rainbow path if no two edges of P are colored the same. The minimum k for which there exists such a k-edge coloring is the rainbow connection number rc(G) of G. If for every pair u, v of distinct vertices, G contains a rainbow u ? v geodesic, then G is called strong rainbow connected. The minimum k for which G is strong rainbow-connected is called the strong rainbow connection number src(G) of G. The exact rc and src of the rotationally symmetric graphs are determined.en-US
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversidad Católica del Norte.en-US
dc.relationhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/4249/3488
dc.rightsCopyright (c) 2020 Yaqoub Ahmed Khan, Muhammad Naeem, Muhammad Kamran Siddiqui, Mohammad Reza Farahanien-US
dc.rightshttp://creativecommons.org/licenses/by/4.0en-US
dc.sourceProyecciones (Antofagasta, On line); Vol. 39 No. 4 (2020): Special Issue: Mathematical Computation in Combinatorics and Graph Theory; 737-747en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 39 Núm. 4 (2020): Special Issue: Mathematical Computation in Combinatorics and Graph Theory; 737-747es-ES
dc.source0717-6279
dc.source10.22199/issn.0717-6279-2020-04
dc.subjectEdge coloringen-US
dc.subjectRainbow coloringen-US
dc.subjectStrong rainbow coloringen-US
dc.subject05C15en-US
dc.subjectColoring of graphs and hypergraphsen-US
dc.subject05C38en-US
dc.subjectPaths and cyclesen-US
dc.subject05C40en-US
dc.subjectConnectivityen-US
dc.titleRainbow and strong rainbow connection number for some families of graphsen-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typePeer-reviewed Articleen-US
dc.typetexten-US


This item appears in the following Collection(s)

Show simple item record