Authors:
- 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
Part of the book series: SpringerBriefs in Mathematics (BRIEFSMATH)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (12 chapters)
-
Front Matter
-
Back Matter
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.
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.
Keywords
- properly colored connectivity
- graph connectivity
- edge-colored graphs
- edge-coloring
- Operations on graphs
- Degree Conditions
- Combinations of Graphs
- Random Graphs
- Strong Proper Connection
- Proper Vertex Connection
- vertex coloring
- distance in graphs
- proper coloring
- Graph connectivity
- chromatic graph theory
- directed graphs
- Hamilton connections
- connections of graphs
- minimum spanning subgraphs
- combinatorics
Reviews
Authors and Affiliations
-
Center for Combinatorics, Nankai University, Tianjin, China
Xueliang Li
-
Department of Mathematics, Georgia Southern University, Statesboro, USA
Colton Magnant
-
College of Science, Chang’an University, Xi’an, China
Zhongmei Qin
Bibliographic Information
Book Title: Properly Colored Connectivity of Graphs
Authors: Xueliang Li, Colton Magnant, Zhongmei Qin
Series Title: SpringerBriefs in Mathematics
DOI: https://doi.org/10.1007/978-3-319-89617-5
Publisher: Springer Cham
eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)
Copyright Information: The Author(s), under exclusive licence to Springer International Publishing AG, part of Springer Nature 2018
Softcover ISBN: 978-3-319-89616-8Published: 24 May 2018
eBook ISBN: 978-3-319-89617-5Published: 14 May 2018
Series ISSN: 2191-8198
Series E-ISSN: 2191-8201
Edition Number: 1
Number of Pages: VIII, 145
Number of Illustrations: 34 b/w illustrations
Topics: Combinatorics, Graph Theory