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...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | Livre numérique |
| اللغة: | Anglais |
| منشور في: |
New York, NY :
Springer New York
[20..].
Cham : Springer Nature |
| سلاسل: | SpringerBriefs in Mathematics
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | Accès sur la plateforme de l'éditeur Accès sur la plateforme de l'éditeur (Springer) Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| ملاحظة: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Variante du titre: | a |
| Edition sous un autre format: | • Rainbow Connections of Graphs, Texte imprimé, 9781461431206 • Rainbow Connections of Graphs, by Xueliang Li, Yuefang Sun, Boston (Mass.), Springer, 2012, 1 vol. (VIII-103 p.), SpringerBriefs in Mathematics, 978-1-4614-3118-3 |
| LEADER | 03859nam a22003977a 4500 | ||
|---|---|---|---|
| 001 | 974043 | ||
| 008 | 120309q2000 xx ||| |||| 00| 0 eng d | ||
| 009 | PPN159082609 | ||
| 020 | |a 9781461431190 |z 9781461431190 | ||
| 020 | |a 9781461431190 | ||
| 041 | 0 | |a eng | |
| 082 | |a 511.5 | ||
| 100 | 1 | |a Li, Xueliang. | |
| 240 | 1 | 0 | |a a |
| 245 | 1 | 0 | |a Rainbow connections of graphs |c Xueliang Li, Yuefang Sun. |
| 260 | |a New York, NY : |b Springer New York. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a SpringerBriefs in Mathematics |x 2191-8201 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 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. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 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 | |a Théorie des graphes | ||
| 650 | |a Coloriage de graphes | ||
| 650 | |a Algorithmes | ||
| 776 | 0 | |t Rainbow Connections of Graphs |b Texte imprimé |z 9781461431206 | |
| 776 | 0 | |0 166586315 |t Rainbow Connections of Graphs |f by Xueliang Li, Yuefang Sun |c Boston (Mass.) |n Springer |d 2012 |p 1 vol. (VIII-103 p.) |s SpringerBriefs in Mathematics |z 978-1-4614-3118-3 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/978-1-4614-3119-0 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://doi.org/10.1007/978-1-4614-3119-0 |z Accès sur la plateforme de l'éditeur (Springer) | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-XKLQ0T8W-8 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750604840 |u https://ezproxy.univ-orleans.fr/login?url=https://dx.doi.org/10.1007/978-1-4614-3119-0 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:753964902 |u https://ezproxy.insa-cvl.fr/login?qurl=https://dx.doi.org/10.1007/978-1-4614-3119-0 |z Accès INSA CVL | |
| 997 | |0 974043 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||