Overview
- Rainbow connection is a new topic in the field of graph theory
- Organized into five categories rainbow connection number, rainbow k-connectivity, k-rainbow index, rainbow vertex-connection number, algorithms and computational complexity?
- Includes supplementary material: sn.pub/extras
Part of the book series: SpringerBriefs in Mathematics (BRIEFSMATH)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (8 chapters)
-
Front Matter
-
Back Matter
Keywords
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.
Authors and Affiliations
Bibliographic Information
Book Title: Rainbow Connections of Graphs
Authors: Xueliang Li, Yuefang Sun
Series Title: SpringerBriefs in Mathematics
DOI: https://doi.org/10.1007/978-1-4614-3119-0
Publisher: Springer New York, NY
eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)
Copyright Information: The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Science+Business Media, LLC, part of Springer Nature 2012
Softcover ISBN: 978-1-4614-3118-3Published: 23 February 2012
eBook ISBN: 978-1-4614-3119-0Published: 23 February 2012
Series ISSN: 2191-8198
Series E-ISSN: 2191-8201
Edition Number: 1
Number of Pages: VIII, 103
Topics: Graph Theory, Data Structures and Information Theory, Number Theory