Xueliang Li

TL;DR: The concept of Rainbow Connection was introduced by Chartrand et al. in 2008 as discussed by the authors, and quite a lot papers have been published about it, and a survey of the results and papers that dealt with it can be found here.

TL;DR: This chapter discusses the motivation and definitions for rainbow connection number, and some graph classes, for dense and sparse graphs, and graph operations, an upper bound for strong Rainbow connection number.

TL;DR: This survey attempts to bring together most of the results and papers that dealt with the concept of rainbow connection, including (strong) rainbow connection number, rainbow k-connectivity, k-rainbow index, rainbow vertex-connection number, algorithms and computational complexity.

TL;DR: The Hermitian-adjacency matrix as mentioned in this paper is a complex adjacency matrix of a mixed graph, which is a Hermitians matrix and called the Hermitia-Adjacency Matrix.

TL;DR: This book enables graduate students to understand and master a segment of graph theory and combinatorial optimization and researchers in graph theory, combinatorics, combinatorsial optimization, probability, computer science, discrete algorithms, complexity analysis, network design, and the information transferring models will find this book useful in their studies.