Rainbow Connection Numbers for Undirected Double-Loop Networks

DOI10.1007/978-3-319-08377-3_12MaRDI QIDQ2942464zbMATH OpenOpenAlexFDO

Authors Yuefang Sun

Publication date 11 September 2015

Published in Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-08377-3_12

zbMATH Keywords

rainbow coloringrainbow connection numberundirected double-loop network

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• Strong rainbow connectivity of undirected double loop networks
• Rainbow connection number and connected dominating sets
• Rainbow connection number and connected dominating sets
• Rainbow connection number of dense graphs
• The rainbow connection number of 2-connected graphs
• Total rainbow connection numbers of some special graphs
• Rainbow connection number and independence number of a graph
• Bounds for the rainbow connection number of graphs
• The rainbow connectivity of a graph

Cited in

(5)

• On total rainbow \(k\)-connected graphs
• Strong rainbow connectivity of undirected double loop networks
• Rainbow Network Flow of Multiple Description Codes
• Strong rainbow connection numbers of toroidal meshes
• Rainbow connection number of corona product of graphs

This page was built for publication: Rainbow Connection Numbers for Undirected Double-Loop Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942464)