Rainbow Connections of Graphs

Yuefang Sun

ISBN 10: 1461431182 / ISBN 13: 9781461431183

Published by Springer New York, Springer US Feb 2012, 2012

About this Item

Neuware -Rainbow connections are natural combinatorial measures that are used in applications to secure the transfer of classified information between agencies incommunication networks. Rainbow Connections of Graphs covers this new and emerging topicin 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 followingcategories,computation of the exact valuesof 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 andgraph 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 112 pp. Englisch.

Seller Inventory # 9781461431183

Bibliographic Details

• Title: Rainbow Connections of Graphs
• Publisher: Springer New York, Springer US Feb 2012
• Publication Date: 2012
• Language: English
• ISBN 10: 1461431182
• ISBN 13: 9781461431183
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 7D millimeters 235 millimeters width by 155 millimeters height by 7 millimeters depth
• Weight: 184 grams

About this title

Synopsis

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.