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

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

Label
Properly Colored Connectivity of Graphs
Title
Properly Colored Connectivity of Graphs
Statement of responsibility
by 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
http://library.link/vocab/creatorName
Li, Xueliang
Image bit depth
0
Literary form
non fiction
Nature of contents
dictionaries
http://library.link/vocab/relatedWorkOrContributorName
  • Magnant, Colton
  • Qin, Zhongmei
Series statement
  • Springer eBooks
  • SpringerBriefs in Mathematics,
  • Springer eBooks.
http://library.link/vocab/subjectName
  • Mathematics
  • Combinatorics
  • Graph theory
Label
Properly Colored Connectivity of Graphs, by Xueliang Li, Colton Magnant, Zhongmei Qin, (electronic resource)
Link
http://ezproxy.eui.eu/login?url=http://dx.doi.org/10.1007/978-3-319-89617-5
Instantiates
Publication
Antecedent source
mixed
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
not applicable
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
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
Control code
978-3-319-89617-5
Dimensions
unknown
Extent
1 online resource (VIII, 145 pages)
File format
multiple file formats
Form of item
  • online
  • electronic
Governing access note
Use of this electronic resource may be governed by a license agreement which restricts use to the European University Institute community. Each user is responsible for limiting use to individual, non-commercial purposes, without systematically downloading, distributing, or retaining substantial portions of information, provided that all copyright and other proprietary notices contained on the materials are retained. The use of software, including scripts, agents, or robots, is generally prohibited and may result in the loss of access to these resources for the entire European University Institute community
Isbn
9783319896175
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-319-89617-5
Other physical details
34 illustrations
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(OCoLC)1035845374
Label
Properly Colored Connectivity of Graphs, by Xueliang Li, Colton Magnant, Zhongmei Qin, (electronic resource)
Link
http://ezproxy.eui.eu/login?url=http://dx.doi.org/10.1007/978-3-319-89617-5
Publication
Antecedent source
mixed
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
not applicable
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
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
Control code
978-3-319-89617-5
Dimensions
unknown
Extent
1 online resource (VIII, 145 pages)
File format
multiple file formats
Form of item
  • online
  • electronic
Governing access note
Use of this electronic resource may be governed by a license agreement which restricts use to the European University Institute community. Each user is responsible for limiting use to individual, non-commercial purposes, without systematically downloading, distributing, or retaining substantial portions of information, provided that all copyright and other proprietary notices contained on the materials are retained. The use of software, including scripts, agents, or robots, is generally prohibited and may result in the loss of access to these resources for the entire European University Institute community
Isbn
9783319896175
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-319-89617-5
Other physical details
34 illustrations
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(OCoLC)1035845374

Library Locations

    • Badia FiesolanaBorrow it
      Via dei Roccettini 9, San Domenico di Fiesole, 50014, IT
      43.803074 11.283055
Processing Feedback ...