## Rainbow Connections of GraphsRainbow connections are natural combinatorial measures that are used in applications to secure the transfer of classified information between agencies in communication networks. 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. |

### What people are saying - Write a review

### Contents

1 | |

Chapter
2 Algorithms and Computational Complexity | 15 |

Chapter
3 Upper Bounds for Rainbow Connection Numbers | 25 |

Chapter
4 Dense and Sparse Graphs | 57 |

Chapter
5 Rainbow Connection Numbers of Some Graph Classes | 65 |

Chapter
6 Rainbow Connection Numbers of Graph Products | 73 |