Properly Colored Connectivity of Graphs

Author:   Xueliang Li ,  Colton Magnant ,  Zhongmei Qin
Publisher:   Springer International Publishing AG
Edition:   1st ed. 2018
ISBN:  

9783319896168


Pages:   145
Publication Date:   24 May 2018
Format:   Paperback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $116.41 Quantity:  
Add to Cart

Share |

Properly Colored Connectivity of Graphs


Add your own review!

Overview

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.

Full Product Details

Author:   Xueliang Li ,  Colton Magnant ,  Zhongmei Qin
Publisher:   Springer International Publishing AG
Imprint:   Springer International Publishing AG
Edition:   1st ed. 2018
Weight:   2.467kg
ISBN:  

9783319896168


ISBN 10:   3319896164
Pages:   145
Publication Date:   24 May 2018
Audience:   College/higher education ,  Postgraduate, Research & Scholarly
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Table of Contents

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.

Reviews

“The book consists of amazingly beautiful concepts and results which are perfect epitomes of structural analysis of graphs and rich with logic, precision and high degree of intuition. The book also opens up new dimensions for further investigations. The authors really deserve much appreciation for the preparation such an amazing book.” (Sudev Naduvath, zbMATH 1475.05002, 2022)


The book consists of amazingly beautiful concepts and results which are perfect epitomes of structural analysis of graphs and rich with logic, precision and high degree of intuition. The book also opens up new dimensions for further investigations. The authors really deserve much appreciation for the preparation such an amazing book. (Sudev Naduvath, zbMATH 1475.05002, 2022)


Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

Aorrng

Shopping Cart
Your cart is empty
Shopping cart
Mailing List