Rainbow connections of graphs (Record no. 29368)

000 -LEADER
fixed length control field nam a22 7a 4500
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 190220b xxu||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781461431183
Terms of availability (pbk)
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 511​.5
Item number LIX
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Li, Xueliang
245 ## - TITLE STATEMENT
Title Rainbow connections of graphs
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc New York :
Name of publisher, distributor, etc Springer,
Date of publication, distribution, etc 2012
300 ## - PHYSICAL DESCRIPTION
Extent viii, 103 p. :
Other physical details ill. ;
Dimensions 23.5 cm.
365 ## - TRADE PRICE
Price type code EURO
Price amount 49.95
Unit of pricing 00
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc Includes bibliographical references and index.
520 ## - SUMMARY, ETC.
Summary, etc 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.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Data display
Topical term or geographic name as entry element Mathematics
Topical term or geographic name as entry element Graph theory
Topical term or geographic name as entry element Data structures
Topical term or geographic name as entry element Number theory
Topical term or geographic name as entry element Cryptology
Topical term or geographic name as entry element Information theory
700 ## - ADDED ENTRY--PERSONAL NAME
Personal name Sun, Yuefang
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Item type Books
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Permanent location Current location Date acquired Source of acquisition Cost, normal purchase price Full call number Barcode Date last seen Koha item type
          DAIICT DAIICT 2019-02-18 Kushal Books 4210.79 511​.5 LIX 031805 2019-02-20 Books

Powered by Koha