Skip to main content
  • Book
  • © 2012

Rainbow Connections of Graphs

  • 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)

Buy it now

Buying options

eBook USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 49.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (8 chapters)

  1. Front Matter

    Pages i-viii
  2. Introduction

    • Xueliang Li, Yuefang Sun
    Pages 1-13
  3. Algorithms and Computational Complexity

    • Xueliang Li, Yuefang Sun
    Pages 15-23
  4. Upper Bounds for Rainbow Connection Numbers

    • Xueliang Li, Yuefang Sun
    Pages 25-55
  5. Dense and Sparse Graphs

    • Xueliang Li, Yuefang Sun
    Pages 57-63
  6. Rainbow Connection Numbers of Some Graph Classes

    • Xueliang Li, Yuefang Sun
    Pages 65-72
  7. Rainbow Connection Numbers of Graph Products

    • Xueliang Li, Yuefang Sun
    Pages 73-76
  8. Rainbow Connectivity

    • Xueliang Li, Yuefang Sun
    Pages 77-88
  9. Rainbow Vertex-Connection Number

    • Xueliang Li, Yuefang Sun
    Pages 89-96
  10. Back Matter

    Pages 97-103

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

  • Center for Combinatorics (CFC), Nankai University, Tianjin, China, People's Republic

    Xueliang Li

  • , Center for Combinatorics, Nankai University, Tianjin, China, People's Republic

    Yuefang Sun

Bibliographic Information

Buy it now

Buying options

eBook USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 49.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access