Rainbow Connections of Graphs

Name: Rainbow Connections of Graphs
Brand: Springer Nature
SKU: 9781461431183
Availability: InStock

Best Price:
Buy Rainbow Connections of Graphs for $34.99 at @ Link.springer.com
No coupon is required — this is the standard retail price.

Set a price drop alert to never miss an offer.

1 Offer Price Range: $34.99 - $34.99

BEST PRICE

Single Product Purchase

$34.99

@ Link.springer.com BUY Now

Price Comparison

Seller	Contact Seller	List Price	On Sale	Shipping	Best Promo	Final Price	Volume Discount	Financing	Availability	Seller's Page
BEST PRICE 1 Product Purchase @ Link.springer.com		$34.99	$34.99			$34.99		See Site	In stock	Visit Store

Product Details

Brand

Springer Nature

Manufacturer

N/A

Part Number

GTIN

9781461431183

Condition

New

Product Description

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.

Available Colors

N/A

Available Sizes

N/A