Rainbow Connections of Graphs

Author/creator Li, Xueliang Author
Other author Sun,Yuefang Author
Format Electronic
Publication InfoNew York : Springer
Description112 p. ill 09.210 x 06.140 in.
Supplemental ContentFull text available from Springer Nature - Springer Mathematics and Statistics eBooks 2012 English International
Supplemental ContentFull text available from Springer Books

SeriesSpringerBriefs in Mathematics Ser.
Summary Annotation Rainbow connections are natural combinatorial measures that are used in applications to secure the transfer of classified information between agencies incommunication networks. Rainbow Connections of Graphs covers this new and emerging topicin graph theory and brings together a majority of the results that deal with the concept of rainbow connections, first introduced by Chartrand et al. in 2006. The authors begin with an introduction to rainbow connectedness, rainbow coloring,and rainbow connection number. The work is organized into the followingcategories,computation of the exact valuesof the rainbow connection numbers for some special graphs, algorithms and complexity analysis, upper bounds in terms of other graph parameters,rainbow connection for dense and sparse graphs, for some graph classes andgraph products, rainbow k-connectivity and k-rainbow index, and, rainbow vertex-connection number.Rainbow Connections of Graphs appeals to researchers and graduate students in the field of graph theory. Conjectures, open problems and questions are given throughout the text with the hope for motivating young graph theorists and graduate students to do further study in this subject.
Access restrictionAvailable only to authorized users.
Technical detailsMode of access: World Wide Web
Genre/formElectronic books.
ISBN9781461431183
ISBN1461431182 (Trade Paper) Active Record
Standard identifier# 9781461431183
Stock number1461431182 00024965