000			nam a22 7a 4500
999			_c29368 _d29368
008			190220b xxu||||| |||| 00| 0 eng d
020			_a9781461431183 _c(pbk)
082			_a511​.5 _bLIX
100			_aLi, Xueliang
245			_aRainbow connections of graphs
260			_aNew York : _bSpringer, _c2012
300			_aviii, 103 p. : _bill. ; _c23.5 cm.
365			_aEURO _b49.95 _d00
504			_aIncludes bibliographical references and index.
520			_aRainbow 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.
650			_aData display
650			_aMathematics
650			_aGraph theory
650			_aData structures
650			_aNumber theory
650			_aCryptology
650			_a Information theory
700			_aSun, Yuefang
942			_2ddc _cBK