Xueliang Li & Colton Magnant 
Properly Colored Connectivity of Graphs [PDF ebook] 

Sokongan

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.


€53.49
cara bayaran

Jadual kandungan

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.

Beli ebook ini dan dapatkan 1 lagi PERCUMA!
Bahasa Inggeris ● Format PDF ● Halaman-halaman 145 ● ISBN 9783319896175 ● Saiz fail 2.7 MB ● Umur 02-99 tahun ● Penerbit Springer International Publishing ● Bandar raya Cham ● Negara CH ● Diterbitkan 2018 ● Muat turun 24 bulan ● Mata wang EUR ● ID 6265557 ● Salin perlindungan Social DRM

Lebih banyak ebook daripada pengarang yang sama / Penyunting

1,374 Ebooks dalam kategori ini