Properly Colored Connectivity of Graphs
Springer International Publishing (Verlag)
978-3-319-89616-8 (ISBN)
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.
1. Introduction.- 2.General Results.- 3. Connectivity Conditions.- 4. Degree Conditions.- 5. Domination Conditions.- 6. Operations on Graphs.- 7..Random Graphs.- 8. Proper k-Connection and Strong Proper Connection.- 9. Proper Vertex Connection and Total Proper Connection.- 10. Directed Graphs.- 11. Other Generalizations.- 12. Computational Complexity.- Bibliography.- Index.
"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)
“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)
| Erscheinungsdatum | 08.06.2018 |
|---|---|
| Reihe/Serie | SpringerBriefs in Mathematics |
| Zusatzinfo | VIII, 145 p. 34 illus. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 248 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Graphentheorie |
| Schlagworte | chromatic graph theory • Combinations of Graphs • combinatorics • connections of graphs • Degree Conditions • Directed graphs • distance in graphs • edge-colored graphs • edge-coloring • graph connectivity • Hamilton connections • minimum spanning subgraphs • Operations on graphs • proper coloring • properly colored connectivity • Proper Vertex Connection • Random Graphs • Strong Proper Connection • vertex coloring |
| ISBN-10 | 3-319-89616-4 / 3319896164 |
| ISBN-13 | 978-3-319-89616-8 / 9783319896168 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
