東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Generalized connectivity of graphs

Li, Xueliang.

FindBook

Google Book

Amazon

博客來

Generalized connectivity of graphs

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Generalized connectivity of graphs/ by Xueliang Li, Yaping Mao.
作者:	Li, Xueliang.
其他作者:	Mao, Yaping.
出版者:	Cham :Springer International Publishing : : 2016.,
面頁冊數:	x, 143 p. :ill. (some col.), digital ;24 cm.
內容註:	1. Introduction -- 2. Results for some graph classes -- 3. Algorithm and complexity -- 4. Sharp bounds of the generalized (edge-) connectivity -- 5. Graphs with given generalized connectivity -- 6. Nordhaus-Gaddum-type results -- 7. Results for graph products -- 8. Maximum generalized local connectivity -- 9. Generalized connectivity for random graphs -- Bibliography -- Index.
Contained By:	Springer eBooks
標題:	Graph connectivity. -
電子資源:	http://dx.doi.org/10.1007/978-3-319-33828-6
ISBN:	9783319338286

Generalized connectivity of graphs
Li, Xueliang.

Generalized connectivity of graphs[electronic resource] /by Xueliang Li, Yaping Mao. - Cham :Springer International Publishing :2016. - x, 143 p. :ill. (some col.), digital ;24 cm. - SpringerBriefs in mathematics,2191-8198. - SpringerBriefs in mathematics..

1. Introduction -- 2. Results for some graph classes -- 3. Algorithm and complexity -- 4. Sharp bounds of the generalized (edge-) connectivity -- 5. Graphs with given generalized connectivity -- 6. Nordhaus-Gaddum-type results -- 7. Results for graph products -- 8. Maximum generalized local connectivity -- 9. Generalized connectivity for random graphs -- Bibliography -- Index.

Noteworthy results, proof techniques, open problems and conjectures in generalized (edge-) connectivity are discussed in this book. Both theoretical and practical analyses for generalized (edge-) connectivity of graphs are provided. Topics covered in this book include: generalized (edge-) connectivity of graph classes, algorithms, computational complexity, sharp bounds, Nordhaus-Gaddum-type results, maximum generalized local connectivity, extremal problems, random graphs, multigraphs, relations with the Steiner tree packing problem and generalizations of connectivity. This book enables graduate students to understand and master a segment of graph theory and combinatorial optimization. Researchers in graph theory, combinatorics, combinatorial optimization, probability, computer science, discrete algorithms, complexity analysis, network design, and the information transferring models will find this book useful in their studies.

ISBN: 9783319338286

Standard No.: 10.1007/978-3-319-33828-6doiSubjects--Topical Terms:

2178889
Graph connectivity.

LC Class. No.: QA166.243

Dewey Class. No.: 511.5

Generalized connectivity of graphs
LDR:02313nmm a2200325 a 4500 001 2041579
003 DE-He213
005 20161130135033.0
006 m d
007 cr nn 008maaau
008 170118s2016 gw s 0 eng d
020 $a 9783319338286 $q (electronic bk.)
020 $a 9783319338279 $q (paper)
024 7 $a 10.1007/978-3-319-33828-6 $2 doi
035 $a 978-3-319-33828-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA166.243
072 7 $a PBV $2 bicssc
072 7 $a MAT013000 $2 bisacsh
082 0 4 $a 511.5 $2 23
090 $a QA166.243 $b .L693 2016
100 1 $a Li, Xueliang. $3 2200295
245 1 0 $a Generalized connectivity of graphs $h [electronic resource] / $c by Xueliang Li, Yaping Mao.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a x, 143 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a SpringerBriefs in mathematics, $x 2191-8198
505 0 $a 1. Introduction -- 2. Results for some graph classes -- 3. Algorithm and complexity -- 4. Sharp bounds of the generalized (edge-) connectivity -- 5. Graphs with given generalized connectivity -- 6. Nordhaus-Gaddum-type results -- 7. Results for graph products -- 8. Maximum generalized local connectivity -- 9. Generalized connectivity for random graphs -- Bibliography -- Index.
520 $a Noteworthy results, proof techniques, open problems and conjectures in generalized (edge-) connectivity are discussed in this book. Both theoretical and practical analyses for generalized (edge-) connectivity of graphs are provided. Topics covered in this book include: generalized (edge-) connectivity of graph classes, algorithms, computational complexity, sharp bounds, Nordhaus-Gaddum-type results, maximum generalized local connectivity, extremal problems, random graphs, multigraphs, relations with the Steiner tree packing problem and generalizations of connectivity. This book enables graduate students to understand and master a segment of graph theory and combinatorial optimization. Researchers in graph theory, combinatorics, combinatorial optimization, probability, computer science, discrete algorithms, complexity analysis, network design, and the information transferring models will find this book useful in their studies.
650 0 $a Graph connectivity. $3 2178889
650 0 $a Computer science $x Mathematics. $3 532725
650 0 $a Combinatorial analysis. $3 523878
650 0 $a Graph theory. $3 523815
650 1 4 $a Mathematics. $3 515831
650 2 4 $a Graph Theory. $3 1567033
650 2 4 $a Combinatorics. $3 895617
650 2 4 $a Discrete Mathematics in Computer Science. $3 892513
650 2 4 $a Operations Research, Management Science. $3 1532996
700 1 $a Mao, Yaping. $3 2200296
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-33828-6
950 $a Mathematics and Statistics (Springer-11649)