SpringerBriefs in Mathematics

Rainbow Connections of Graphs

Authors: Li, Xueliang, Sun, Yuefang

  • 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​
Show all benefits

Buy this book

eBook $34.99
price for USA (gross)
  • ISBN 978-1-4614-3119-0
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $49.95
price for USA
  • ISBN 978-1-4614-3118-3
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Rent the ebook  
  • Rental duration: 1 or 6 month
  • low-cost access
  • online reader with highlighting and note-making option
  • can be used across all devices
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.


Table of contents (8 chapters)

  • Introduction

    Li, Xueliang (et al.)

    Pages 1-13

  • Algorithms and Computational Complexity

    Li, Xueliang (et al.)

    Pages 15-23

  • Upper Bounds for Rainbow Connection Numbers

    Li, Xueliang (et al.)

    Pages 25-55

  • Dense and Sparse Graphs

    Li, Xueliang (et al.)

    Pages 57-63

  • Rainbow Connection Numbers of Some Graph Classes

    Li, Xueliang (et al.)

    Pages 65-72

Buy this book

eBook $34.99
price for USA (gross)
  • ISBN 978-1-4614-3119-0
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $49.95
price for USA
  • ISBN 978-1-4614-3118-3
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Rent the ebook  
  • Rental duration: 1 or 6 month
  • low-cost access
  • online reader with highlighting and note-making option
  • can be used across all devices
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Rainbow Connections of Graphs
Authors
Series Title
SpringerBriefs in Mathematics
Copyright
2012
Publisher
Springer-Verlag New York
Copyright Holder
Xueliang Li, Yuefang Sun
eBook ISBN
978-1-4614-3119-0
DOI
10.1007/978-1-4614-3119-0
Softcover ISBN
978-1-4614-3118-3
Series ISSN
2191-8198
Edition Number
1
Number of Pages
VIII, 103
Topics