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...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Li, Xueliang (Autor), Sun, Yuefang (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: New York, NY : Springer New York : Imprint: Springer, 2012.
Edición:1st ed. 2012.
Colección:SpringerBriefs in Mathematics,
Temas:
Graph theory.
Data structures (Computer science).
Information theory.
Number theory.
Graph Theory.
Data Structures and Information Theory.
Number Theory.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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.

Ejemplares similares