Advertisement

Properly Colored Connectivity of Graphs

  • Xueliang Li
  • Colton Magnant
  • Zhongmei Qin

Part of the SpringerBriefs in Mathematics book series (BRIEFSMATH)

Table of contents

  1. Front Matter
    Pages i-viii
  2. Xueliang Li, Colton Magnant, Zhongmei Qin
    Pages 1-8
  3. Xueliang Li, Colton Magnant, Zhongmei Qin
    Pages 9-13
  4. Xueliang Li, Colton Magnant, Zhongmei Qin
    Pages 15-22
  5. Xueliang Li, Colton Magnant, Zhongmei Qin
    Pages 23-39
  6. Xueliang Li, Colton Magnant, Zhongmei Qin
    Pages 41-45
  7. Xueliang Li, Colton Magnant, Zhongmei Qin
    Pages 47-61
  8. Xueliang Li, Colton Magnant, Zhongmei Qin
    Pages 63-72
  9. Xueliang Li, Colton Magnant, Zhongmei Qin
    Pages 73-84
  10. Xueliang Li, Colton Magnant, Zhongmei Qin
    Pages 85-95
  11. Xueliang Li, Colton Magnant, Zhongmei Qin
    Pages 97-102
  12. Xueliang Li, Colton Magnant, Zhongmei Qin
    Pages 103-135
  13. Xueliang Li, Colton Magnant, Zhongmei Qin
    Pages 137-138
  14. Back Matter
    Pages 139-145

About this book

Introduction

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

Authors and affiliations

  • Xueliang Li
    • 1
  • Colton Magnant
    • 2
  • Zhongmei Qin
    • 3
  1. 1.Center for CombinatoricsNankai UniversityTianjinChina
  2. 2.Department of MathematicsGeorgia Southern UniversityStatesboroUSA
  3. 3.College of ScienceChang’an UniversityXi’anChina

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-89617-5
  • Copyright Information The Author(s), under exclusive licence to Springer International Publishing AG, part of Springer Nature 2018
  • Publisher Name Springer, Cham
  • eBook Packages Mathematics and Statistics
  • Print ISBN 978-3-319-89616-8
  • Online ISBN 978-3-319-89617-5
  • Series Print ISSN 2191-8198
  • Series Online ISSN 2191-8201
  • Buy this book on publisher's site