EDP Sciences 1787034779 20260818 fre

laboutique.edpsciences.fr-R002884 03 01 01 R002884 00 ED E107 00 01 01 Rainbow Connection Numbers of Graphs 01 eng 08 114 03 22 42635233 17 01 P15 EDP Sciences & Science Press 01 01 P15 EDP Sciences & Science Press 11 00 20260818 02 01 003059 03 9782759841080 15 9782759841080 03 01 D1 EDP Sciences 45 03 laboutique.edpsciences.fr-003059 03 01 01 003059 03 9782759841080 15 9782759841080 10 EA E107 10 00 01 R002884 ED E107 1 10 01 02 Hors collection - 01 01 Rainbow Connection Numbers of Graphs 1 A01 01 A2488 Jiuying DONG DONG, Jiuying Jiuying DONG <p>Jiuying DONG is Professor and Doctoral Supervisor at the Shanghai Institute of Technology. She received her Ph.D. from the Center for Combinatorics at Nankai University. Her research interests lie in graph theory, combinatorial optimization, and decision optimization analysis.</p> 01 eng 08 112 03 01 20 Discrete mathematics;graph theory;combinatorics;probability;algorithms;computational complexity 10 2011 MAT008000 29 CLIL3057 01 510 05 06 03 00 <p>In 2006, Chartrand, Johns, McKeon and Zhang introduced the concept of rainbow edge-coloring. A graph G is defined as rainbow connected if every pair of vertices is linked by a path whose edges all receive distinct colors.. The rainbow connection number, rc(G), is the minimum number of colors required to achieve this property. In 2008, Krivelevich and Yuster extended the concept to vertices by introducing the rainbow vertex-connection number, rvc(G). Beyond its role as a natural combinatorial measure, rainbow connection number has applications in secure information transmission and communication network design.&nbsp;</p><p>This book presents the major results on rainbow connection numbers and related graph parameters. It covers upper bounds involving order, minimum degree and degree sum; relationships with radius, diameter, and independence number; results for dense, sparse and random graphs; as well as computational complexity and algorithmic aspects.</p><p>Written for graduate students and researchers, this book is of interest to readers working in graph theory, combinatorics, probability, algorithms, and computational complexity.</p> 02 00 <p>This book presents the major results on rainbow connection numbers and related graph parameters. It covers upper bounds involving order, minimum degree and degree sum; relationships with radius, diameter, and independence number; results for dense, sparse and random graphs; as well as computational complexity and algorithmic aspects.</p> 04 00 <p>See 'Complements'</p> 21 00 06 01 https://laboutique.edpsciences.fr/produit/1594/9782759841080/rainbow-connection-numbers-of-graphs 01 00 03 02 https://laboutique.edpsciences.fr/system/product_pictures/data/009/983/667/original/9782759841073-Rainbow_Connection_Numbers_of_Graphs_couv-sofedis.jpg 17 14 20260810T161003+0200 01 P15 EDP Sciences & Science Press 01 01 P15 EDP Sciences & Science Press 04 11 00 20260818 01 00 20260818 19 00 20260818 2026 06 3052868830012 01 WORLD 13 03 9782759841073 15 9782759841073 WORLD 08 EDP Sciences & Science Press 04 01 00 20260818 03 01 D1 EDP Sciences 20 04 05 01 02 1 00 65.99 01 5.50 3.44 EUR 04 06 01 02 1 00 231.99 01 5.50 3.44 EUR 01 04 06 01 02 1 00 255.99 01 5.50 13.35 USD 01