Coverart for item
The Resource Properly Colored Connectivity of Graphs, Xueliang Li, Colton Magnant, Zhongmei Qin, (electronic book)

Properly Colored Connectivity of Graphs, Xueliang Li, Colton Magnant, Zhongmei Qin, (electronic book)

Label
Properly Colored Connectivity of Graphs
Title
Properly Colored Connectivity of Graphs
Statement of responsibility
Xueliang Li, Colton Magnant, Zhongmei Qin
Creator
Contributor
Author
Subject
Language
eng
Summary
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.--
Member of
Assigning source
Provided by publisher
Cataloging source
N$T
http://library.link/vocab/creatorDate
1958-
http://library.link/vocab/creatorName
Li, X.
Dewey number
511.5
Illustrations
illustrations
Index
index present
LC call number
QA166.243
Literary form
non fiction
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorName
  • Magnant, Colton
  • Qin, Zhongmei
Series statement
SpringerBriefs in mathematics
http://library.link/vocab/subjectName
Graph connectivity
Label
Properly Colored Connectivity of Graphs, Xueliang Li, Colton Magnant, Zhongmei Qin, (electronic book)
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • Intro; Preface; Contents; 1 Introduction; 1.1 Overview; 1.2 Basic Graph Theoretical Definitions; 1.3 Specific Definitions and Some History; 1.4 Preliminary Results; 1.5 Applications; 2 General Results; 3 Connectivity Conditions; 4 Degree Conditions; 4.1 Minimum Degree; 4.2 Degree Sum; 4.3 Edge Density; 5 Domination Conditions; 6 Operations on Graphs; 6.1 Unary Operations; 6.1.1 Complement; 6.1.2 Line Graphs; 6.1.3 Permutation; 6.1.4 kth Power; 6.1.5 Iterated Corona; 6.2 Binary Operations; 6.2.1 Join; 6.2.2 Cartesian Product; 6.2.3 Direct Product; 7 Random Graphs
  • 8 Proper k-Connection and Strong Proper Connection8.1 Proper k-Connection; 8.2 Strong Proper Connection; 8.2.1 General Results; 8.2.2 Operations on Graphs; 9 Proper Vertex Connection and Total Proper Connection; 9.1 Proper Vertex Connection; 9.2 Total Proper Connection; 10 Directed Graphs; 10.1 Proper Connection; 10.2 Proper Vertex Connection; 11 Other Generalizations; 11.1 (k, )-Rainbow Connectivity; 11.2 Proper Hamiltonian-Connection; 11.3 Proper-Walk Connection; 11.4 Proper Index; 11.5 Proper Distance; 11.6 Minimum Spanning Subgraphs; 12 Computational Complexity; References; Index
Extent
1 online resource
Form of item
online
Isbn
9783319896168
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations
System control number
  • on1035845374
  • (OCoLC)1035845374
Label
Properly Colored Connectivity of Graphs, Xueliang Li, Colton Magnant, Zhongmei Qin, (electronic book)
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • Intro; Preface; Contents; 1 Introduction; 1.1 Overview; 1.2 Basic Graph Theoretical Definitions; 1.3 Specific Definitions and Some History; 1.4 Preliminary Results; 1.5 Applications; 2 General Results; 3 Connectivity Conditions; 4 Degree Conditions; 4.1 Minimum Degree; 4.2 Degree Sum; 4.3 Edge Density; 5 Domination Conditions; 6 Operations on Graphs; 6.1 Unary Operations; 6.1.1 Complement; 6.1.2 Line Graphs; 6.1.3 Permutation; 6.1.4 kth Power; 6.1.5 Iterated Corona; 6.2 Binary Operations; 6.2.1 Join; 6.2.2 Cartesian Product; 6.2.3 Direct Product; 7 Random Graphs
  • 8 Proper k-Connection and Strong Proper Connection8.1 Proper k-Connection; 8.2 Strong Proper Connection; 8.2.1 General Results; 8.2.2 Operations on Graphs; 9 Proper Vertex Connection and Total Proper Connection; 9.1 Proper Vertex Connection; 9.2 Total Proper Connection; 10 Directed Graphs; 10.1 Proper Connection; 10.2 Proper Vertex Connection; 11 Other Generalizations; 11.1 (k, )-Rainbow Connectivity; 11.2 Proper Hamiltonian-Connection; 11.3 Proper-Walk Connection; 11.4 Proper Index; 11.5 Proper Distance; 11.6 Minimum Spanning Subgraphs; 12 Computational Complexity; References; Index
Extent
1 online resource
Form of item
online
Isbn
9783319896168
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations
System control number
  • on1035845374
  • (OCoLC)1035845374

Library Locations

Processing Feedback ...