Properly Colored Connectivity of Graphs
Buch in deiner Nähe kaufen
Beschreibung
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.
Unifies up-to-date results and techniques used to study the proper connection number Outlines varied approaches and advances to current open problems and conjectures Features different applications of chromatic graph theory
Autor*in
Xueliang Li
Themen in »Properly Colored Connectivity of Graphs«
properly colored connectivity graph connectivity edge-colored graphs edge-coloring Operations on graphs Degree Conditions Combinations of Graphs Random Graphs Strong Proper Connection Proper Vertex Connection vertex coloring distance in graphs proper coloring Graph connectivity chromatic graph theory
Stimmen zu »Properly Colored Connectivity of Graphs«
“The book consists of amazingly beautiful concepts and results which are perfect epitomes of structural analysis of graphs and rich with logic, precision and high degree of intuition. The book also opens up new dimensions for further investigations. The authors really deserve much appreciation for the preparation such an amazing book.” (Sudev Naduvath, zbMATH 1475.05002, 2022)
()