Properly colored connectivity of graphs

著者

書誌事項

Properly colored connectivity of graphs

Xueliang Li, Colton Magnant, Zhongmei Qin

(SpringerBriefs in mathematics)

Springer, c2018

  • : [pbk.]

大学図書館所蔵 件 / 2

この図書・雑誌をさがす

注記

Includes biliographical references (p. 139-141) and index

内容説明・目次

内容説明

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.

目次

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.

「Nielsen BookData」 より

関連文献: 1件中  1-1を表示

詳細情報

  • NII書誌ID(NCID)
    BB26361832
  • ISBN
    • 9783319896168
  • LCCN
    2018940435
  • 出版国コード
    sz
  • タイトル言語コード
    eng
  • 本文言語コード
    eng
  • 出版地
    [Cham]
  • ページ数/冊数
    viii, 145 p.
  • 大きさ
    24 cm
  • 親書誌ID
ページトップへ