Properly colored connectivity of graphs

• 作者： Li, Xueliang, author.
• 其他作者：
  • Magnant, Colton, author.
  • Qin, Zhongmei, author.
  • SpringerLink (Online service)
• 其他題名：
  • SpringerBriefs in mathematics.
• 出版： Cham : Springer International Publishing :Imprint: Springer
• 叢書名： SpringerBriefs in mathematics,
• 主題： Graph connectivity. , Mathematics. , Combinatorics. , Graph Theory.
• ISBN： 9783319896175 (electronic bk.) 、 9783319896168 (paper)
• FIND@SFXID: CGU
• 資料類型: 電子書
• 內容註: 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.
• More
• 摘要註: 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.
• 讀者標籤：

  需登入
• 引用連結：

  Copy Link
• 目前引用數
• Share: