
Rainbow Connections of Graphs
Springer (Publisher)
Published on 23. February 2012
Book
Paperback/Softback
VIII, 103 pages
978-1-4614-3118-3 (ISBN)
Description
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.
More details
Series
Edition
2012 ed.
Language
English
Place of publication
New York
United States
Target group
Professional and scholarly
Research
Illustrations
VIII, 103 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 7 mm
Weight
184 gr
ISBN-13
978-1-4614-3118-3 (9781461431183)
DOI
10.1007/978-1-4614-3119-0
Schweitzer Classification
Other editions
Additional editions

Xueliang Li | Yuefang Sun
Rainbow Connections of Graphs
E-Book
02/2012
1st Edition
Springer
€52.99
Available for download
Content
1. Introduction (Motivation and definitions, Terminology and notations).- 2. (Strong) Rainbow connection number(Basic results, Upper bounds for rainbow connection number, For some graph classes, For dense and sparse graphs, For graph operations, An upper bound for strong rainbow connection number).- 3. Rainbow k-connectivity.- 4. k-rainbow index.- 5. Rainbow vertex-connection number.- 6. Algorithms and computational complexity.- References.