Rainbow Connections of Graphs: SpringerBriefs in Mathematics
Autor Xueliang Li, Yuefang Sunen Limba Engleză Paperback – 23 feb 2012
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.
Din seria SpringerBriefs in Mathematics
- Preț: 366.00 lei
- Preț: 366.53 lei
- Preț: 369.52 lei
- Preț: 351.57 lei
- Preț: 352.28 lei
- Preț: 350.11 lei
- Preț: 328.80 lei
- Preț: 364.70 lei
- Preț: 452.06 lei
- Preț: 365.22 lei
- Preț: 352.28 lei
- Preț: 429.84 lei
- Preț: 351.57 lei
- 15% Preț: 446.18 lei
- Preț: 363.75 lei
- Preț: 363.93 lei
- Preț: 352.28 lei
- Preț: 365.43 lei
- Preț: 362.65 lei
- Preț: 365.80 lei
- Preț: 351.90 lei
- Preț: 330.82 lei
- Preț: 350.81 lei
- Preț: 349.41 lei
- 15% Preț: 446.67 lei
- Preț: 411.36 lei
- Preț: 351.90 lei
- 15% Preț: 446.81 lei
- Preț: 366.69 lei
- Preț: 331.56 lei
- 15% Preț: 444.77 lei
- Preț: 363.02 lei
- Preț: 364.12 lei
- Preț: 332.50 lei
- Preț: 355.76 lei
- 20% Preț: 352.85 lei
- Preț: 453.15 lei
- Preț: 366.17 lei
- Preț: 363.75 lei
- Preț: 330.15 lei
- Preț: 541.13 lei
- 15% Preț: 444.31 lei
- Preț: 365.43 lei
- Preț: 365.43 lei
- Preț: 330.82 lei
- Preț: 350.11 lei
- Preț: 431.36 lei
- Preț: 364.70 lei
- Preț: 331.93 lei
Preț: 331.19 lei
Nou
Puncte Express: 497
Preț estimativ în valută:
63.39€ • 66.87$ • 52.82£
63.39€ • 66.87$ • 52.82£
Carte tipărită la comandă
Livrare economică 02-16 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781461431183
ISBN-10: 1461431182
Pagini: 105
Ilustrații: VIII, 103 p.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.17 kg
Ediția:2012
Editura: Springer
Colecția Springer
Seria SpringerBriefs in Mathematics
Locul publicării:New York, NY, United States
ISBN-10: 1461431182
Pagini: 105
Ilustrații: VIII, 103 p.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.17 kg
Ediția:2012
Editura: Springer
Colecția Springer
Seria SpringerBriefs in Mathematics
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
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.
Caracteristici
Rainbow connection is a new topic in the field of graph theory Organized into five categories rainbow connection number, rainbow k-connectivity, k-rainbow index, rainbow vertex-connection number, algorithms and computational complexity? Includes supplementary material: sn.pub/extras