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...
Tallennettuna:
| Päätekijä: | |
|---|---|
| Aineistotyyppi: | Livre numérique |
| Kieli: | Anglais |
| Julkaistu: |
New York, NY :
Springer New York
[20..].
Cham : Springer Nature |
| Sarja: | SpringerBriefs in Mathematics
|
| Aiheet: | |
| Linkit: | 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 |
| Huomautus: |
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 |
Sisällysluettelo:
- 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.