About this book
Rainbow connections are natural combinatorial measures that are used in applications to secure the transfer of classified information between agencies in communication networks. Rainbow Connections of Graphs covers this new and emerging topic in 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 following categories, computation of the exact values of 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 and graph 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.
- DOI https://doi.org/10.1007/978-1-4614-3119-0
- Copyright Information Xueliang Li, Yuefang Sun 2012
- Publisher Name Springer, Boston, MA
- eBook Packages Mathematics and Statistics
- Print ISBN 978-1-4614-3118-3
- Online ISBN 978-1-4614-3119-0
- Series Print ISSN 2191-8198
- Series Online ISSN 2191-8201
- About this book