Properly Colored Connectivity of Graphs
(Sprache: Englisch)
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...
Voraussichtlich lieferbar in 3 Tag(en)
versandkostenfrei
Buch (Kartoniert)
Fr. 59.90
inkl. MwSt.
- Kreditkarte, Paypal, Rechnungskauf
- 30 Tage Widerrufsrecht
Produktdetails
Produktinformationen zu „Properly Colored Connectivity of Graphs “
Klappentext zu „Properly Colored Connectivity of Graphs “
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.
Inhaltsverzeichnis zu „Properly Colored Connectivity of Graphs “
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.Bibliographische Angaben
- Autoren: Xueliang Li , Colton Magnant , Zhongmei Qin
- 2018, 1st ed. 2018, VIII, 145 Seiten, Masse: 15,5 x 23,5 cm, Kartoniert (TB), Englisch
- Verlag: Springer, Berlin
- ISBN-10: 3319896164
- ISBN-13: 9783319896168
- Erscheinungsdatum: 24.05.2018
Sprache:
Englisch
Pressezitat
"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)
Kommentar zu "Properly Colored Connectivity of Graphs"
0 Gebrauchte Artikel zu „Properly Colored Connectivity of Graphs“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Properly Colored Connectivity of Graphs".
Kommentar verfassen