Rainbow Connections of Graphs
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 res...
| Main Authors: | , |
|---|---|
| Corporate Author: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Boston, MA :
Springer US,
2012.
|
| Series: | SpringerBriefs in Mathematics,
|
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
Table of Contents:
- 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.
