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...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριοι συγγραφείς: Li, Xueliang (Συγγραφέας, http://id.loc.gov/vocabulary/relators/aut), Magnant, Colton (http://id.loc.gov/vocabulary/relators/aut), Qin, Zhongmei (http://id.loc.gov/vocabulary/relators/aut)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2018.
Έκδοση:1st ed. 2018.
Σειρά:SpringerBriefs in Mathematics,
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03284nam a2200493 4500
001 978-3-319-89617-5
003 DE-He213
005 20191026162717.0
007 cr nn 008mamaa
008 180514s2018 gw | s |||| 0|eng d
020 |a 9783319896175  |9 978-3-319-89617-5 
024 7 |a 10.1007/978-3-319-89617-5  |2 doi 
040 |d GrThAP 
050 4 |a QA164-167.2 
072 7 |a PBV  |2 bicssc 
072 7 |a MAT036000  |2 bisacsh 
072 7 |a PBV  |2 thema 
082 0 4 |a 511.6  |2 23 
100 1 |a Li, Xueliang.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Properly Colored Connectivity of Graphs  |h [electronic resource] /  |c by Xueliang Li, Colton Magnant, Zhongmei Qin. 
250 |a 1st ed. 2018. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2018. 
300 |a VIII, 145 p. 34 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a SpringerBriefs in Mathematics,  |x 2191-8198 
505 0 |a 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. 
520 |a 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. 
650 0 |a Combinatorics. 
650 0 |a Graph theory. 
650 1 4 |a Combinatorics.  |0 http://scigraph.springernature.com/things/product-market-codes/M29010 
650 2 4 |a Graph Theory.  |0 http://scigraph.springernature.com/things/product-market-codes/M29020 
700 1 |a Magnant, Colton.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
700 1 |a Qin, Zhongmei.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783319896168 
776 0 8 |i Printed edition:  |z 9783319896182 
830 0 |a SpringerBriefs in Mathematics,  |x 2191-8198 
856 4 0 |u https://doi.org/10.1007/978-3-319-89617-5  |z Full Text via HEAL-Link 
912 |a ZDB-2-SMA 
950 |a Mathematics and Statistics (Springer-11649)