|
|
books
| book details |
Rainbow Connections of Graphs
By (author) Xueliang Li, By (author) Yuefang Sun
|
| on special |
normal price: R 1 920.95
Price: R 1 728.95
|
| book description |
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.
| product details |
Normally shipped |
Publisher | Springer-Verlag New York Inc.
Published date | 23 Feb 2012
Language |
Format | Paperback / softback
Pages | 103
Dimensions | 235 x 155 x 0mm (L x W x H)
Weight | 0g
ISBN | 978-1-4614-3118-3
Readership Age |
BISAC | mathematics / combinatorics
| other options |
|
|
To view the items in your trolley please sign in.
| sign in |
|
|
|
| specials |
|
|
Mason Coile
Paperback / softback
224 pages
was: R 520.95
now: R 468.95
|
A terrifying locked-room mystery set in a remote outpost on Mars.
|
An epic love story with the pulse of a thriller that asks: what would you risk for a second chance at first love?
|
|
|
|
|
|
