| Properly Colored Connectivity of Graphs 2018 Edition Contributor(s): Li, Xueliang (Author), Magnant, Colton (Author), Qin, Zhongmei (Author) |
|
 |
ISBN: 3319896164 ISBN-13: 9783319896168 Publisher: Springer OUR PRICE: $52.24 Product Type: Paperback - Other Formats Published: May 2018 |
| Additional Information |
| BISAC Categories: - Mathematics | Combinatorics - Mathematics | Graphic Methods - Mathematics | Discrete Mathematics |
| Dewey: 511.5 |
| Series: Springerbriefs in Mathematics |
| Physical Information: 0.33" H x 6.14" W x 9.21" (0.50 lbs) 145 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: A comprehensive survey of proper connection of graphs is discussed in this book with real world applications in computer science and network security. Beginning with a brief introduction, comprising relevant definitions and preliminary results, this book moves on to consider a variety of properties of graphs that imply bounds on the proper connection number. Detailed proofs of significant advancements toward open problems and conjectures are presented with complete references. Researchers and graduate students with an interest in graph connectivity and colorings will find this book useful as it builds upon fundamental definitions towards modern innovations, strategies, and techniques. The detailed presentation lends to use as an introduction to proper connection of graphs for new and advanced researchers, a solid book for a graduate level topics course, or as a reference for those interested in expanding and further developing research in the area. |