Shortcuts
Please wait while page loads.
SISSA Library . Default .
PageMenu- Main Menu-
Page content

Catalogue Display

Rainbow Connections of Graphs

Rainbow Connections of Graphs
Catalogue Information
Field name Details
Dewey Class 511.5
Title Rainbow Connections of Graphs ([Ebook]) / by Xueliang Li, Yuefang Sun.
Author Li, Xueliang
Added Personal Name Sun, Yuefang
Other name(s) SpringerLink (Online service)
Publication Boston, MA : Springer US , 2012.
Physical Details VIII, 103 pages : online resource.
Series SpringerBriefs in Mathematics 2191-8198
ISBN 9781461431190
Summary Note 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.:
Contents note 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.
System details note Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site http://dx.doi.org/10.1007/978-1-4614-3119-0
Links to Related Works
Subject References:
Authors:
Corporate Authors:
Series:
Classification:
Catalogue Information 28574 Beginning of record . Catalogue Information 28574 Top of page .

Reviews


This item has not been rated.    Add a Review and/or Rating28574
Quick Search