Properly Colored Connectivity of Graphs
Authors: Li, Xueliang, Magnant, Colton, Qin, Zhongmei
Free Preview- Unifies up-to-date results and techniques used to study the proper connection number
- Outlines varied approaches and advances to current open problems and conjectures
- Features different applications of chromatic graph theory
Buy this book
- About this book
-
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.
- Table of contents (12 chapters)
-
-
Introduction
Pages 1-8
-
General Results
Pages 9-13
-
Connectivity Conditions
Pages 15-22
-
Degree Conditions
Pages 23-39
-
Domination Conditions
Pages 41-45
-
Table of contents (12 chapters)
Recommended for you

Bibliographic Information
- Bibliographic Information
-
- Book Title
- Properly Colored Connectivity of Graphs
- Authors
-
- Xueliang Li
- Colton Magnant
- Zhongmei Qin
- Series Title
- SpringerBriefs in Mathematics
- Copyright
- 2018
- Publisher
- Springer International Publishing
- Copyright Holder
- The Author(s), under exclusive licence to Springer International Publishing AG, part of Springer Nature
- eBook ISBN
- 978-3-319-89617-5
- DOI
- 10.1007/978-3-319-89617-5
- Softcover ISBN
- 978-3-319-89616-8
- Series ISSN
- 2191-8198
- Edition Number
- 1
- Number of Pages
- VIII, 145
- Number of Illustrations
- 34 b/w illustrations
- Topics