Properly Colored Connectivity of Graphs

ISBN-13: 9783319896168 / Angielski / Miękka / 2018 / 145 str.

Xueliang Li; Colton Magnant; Zhongmei Qin

Opis

A comprehensive survey of proper connection of graphs is discussed in this book with real world applications in computer science and network security.

Recenzje

"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)

Spis treści

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.