Cargando…
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autores principales: | , |
| Autor Corporativo: | |
| 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: | |
| Acceso en línea: | Texto Completo |
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-1-4614-3119-0 | ||
| 003 | DE-He213 | ||
| 005 | 20230412152834.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 120223s2012 xxu| s |||| 0|eng d | ||
| 020 | |a 9781461431190 |9 978-1-4614-3119-0 | ||
| 024 | 7 | |a 10.1007/978-1-4614-3119-0 |2 doi | |
| 050 | 4 | |a QA166-166.247 | |
| 072 | 7 | |a PBV |2 bicssc | |
| 072 | 7 | |a MAT013000 |2 bisacsh | |
| 072 | 7 | |a PBV |2 thema | |
| 082 | 0 | 4 | |a 511.5 |2 23 |
| 100 | 1 | |a Li, Xueliang. |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 245 | 1 | 0 | |a Rainbow Connections of Graphs |h [electronic resource] / |c by Xueliang Li, Yuefang Sun. |
| 250 | |a 1st ed. 2012. | ||
| 264 | 1 | |a New York, NY : |b Springer New York : |b Imprint: Springer, |c 2012. | |
| 300 | |a VIII, 103 p. |b online resource. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file |b PDF |2 rda | ||
| 490 | 1 | |a SpringerBriefs in Mathematics, |x 2191-8201 | |
| 505 | 0 | |a 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. | |
| 520 | |a 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. | ||
| 650 | 0 | |a Graph theory. | |
| 650 | 0 | |a Data structures (Computer science). | |
| 650 | 0 | |a Information theory. | |
| 650 | 0 | |a Number theory. | |
| 650 | 1 | 4 | |a Graph Theory. |
| 650 | 2 | 4 | |a Data Structures and Information Theory. |
| 650 | 2 | 4 | |a Number Theory. |
| 700 | 1 | |a Sun, Yuefang. |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9781461431206 |
| 776 | 0 | 8 | |i Printed edition: |z 9781461431183 |
| 830 | 0 | |a SpringerBriefs in Mathematics, |x 2191-8201 | |
| 856 | 4 | 0 | |u https://doi.uam.elogim.com/10.1007/978-1-4614-3119-0 |z Texto Completo |
| 912 | |a ZDB-2-SMA | ||
| 912 | |a ZDB-2-SXMS | ||
| 950 | |a Mathematics and Statistics (SpringerNature-11649) | ||
| 950 | |a Mathematics and Statistics (R0) (SpringerNature-43713) | ||