Properly Colored Connectivity of Graphs
Zhongmei Qin, Xueliang Li, Colton Magnant, et al.
* Affiliatelinks/Werbelinks
Links auf reinlesen.de sind sogenannte Affiliate-Links. Wenn du auf so einen Affiliate-Link klickst und über diesen Link einkaufst, bekommt reinlesen.de von dem betreffenden Online-Shop oder Anbieter eine Provision. Für dich verändert sich der Preis nicht.
Springer International Publishing
Naturwissenschaften, Medizin, Informatik, Technik / Sonstiges
Beschreibung
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.
Kundenbewertungen
connections of graphs, Degree Conditions, Graph connectivity, chromatic graph theory, properly colored connectivity, Combinations of Graphs, Operations on graphs, distance in graphs, proper coloring, combinatorics, edge-coloring, Strong Proper Connection, Hamilton connections, vertex coloring, minimum spanning subgraphs, graph connectivity, edge-colored graphs, Proper Vertex Connection, Random Graphs, directed graphs