東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Properly colored connectivity of graphs

Li, Xueliang.

FindBook

Google Book

Amazon

博客來

Properly colored connectivity of graphs

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Properly colored connectivity of graphs/ by Xueliang Li, Colton Magnant, Zhongmei Qin.
作者:	Li, Xueliang.
其他作者:	Magnant, Colton.
出版者:	Cham :Springer International Publishing : : 2018.,
面頁冊數:	viii, 145 p. :ill., digital ;24 cm.
內容註:	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.
Contained By:	Springer eBooks
標題:	Graph connectivity. -
電子資源:	http://dx.doi.org/10.1007/978-3-319-89617-5
ISBN:	9783319896175

Properly colored connectivity of graphs
Li, Xueliang.

Properly colored connectivity of graphs[electronic resource] /by Xueliang Li, Colton Magnant, Zhongmei Qin. - Cham :Springer International Publishing :2018. - viii, 145 p. :ill., digital ;24 cm. - SpringerBriefs in mathematics,2191-8198. - SpringerBriefs in mathematics..

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.

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.

ISBN: 9783319896175

Standard No.: 10.1007/978-3-319-89617-5doiSubjects--Topical Terms:

2178889
Graph connectivity.

LC Class. No.: QA166.243 / .L59 2018

Dewey Class. No.: 511.5

Properly colored connectivity of graphs
LDR:02370nmm a2200325 a 4500 001 2146215
003 DE-He213
005 20181129153054.0
006 m d
007 cr nn 008maaau
008 190227s2018 gw s 0 eng d
020 $a 9783319896175 $q (electronic bk.)
020 $a 9783319896168 $q (paper)
024 7 $a 10.1007/978-3-319-89617-5 $2 doi
035 $a 978-3-319-89617-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA166.243 $b .L59 2018
072 7 $a PBV $2 bicssc
072 7 $a MAT036000 $2 bisacsh
082 0 4 $a 511.5 $2 23
090 $a QA166.243 $b .L693 2018
100 1 $a Li, Xueliang. $3 2200295
245 1 0 $a Properly colored connectivity of graphs $h [electronic resource] / $c by Xueliang Li, Colton Magnant, Zhongmei Qin.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a viii, 145 p. : $b ill., digital ; $c 24 cm.
490 1 $a SpringerBriefs in mathematics, $x 2191-8198
505 0 $a 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.
520 $a 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.
650 0 $a Graph connectivity. $3 2178889
650 1 4 $a Mathematics. $3 515831
650 2 4 $a Combinatorics. $3 895617
650 2 4 $a Graph Theory. $3 1567033
700 1 $a Magnant, Colton. $3 1035800
700 1 $a Qin, Zhongmei. $3 3332580
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a SpringerBriefs in mathematics. $3 1566700
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-89617-5
950 $a Mathematics and Statistics (Springer-11649)