| 書目名稱 | Generalized Connectivity of Graphs | | 編輯 | Xueliang Li,Yaping Mao | | 視頻video | http://file.papertrans.cn/383/382182/382182.mp4 | | 概述 | Brings together results, conjectures, and open problems on generalized connectivity.Features theoretical and practical analysis for generalized (edge-) connectivity.Contains essential proofs.Includes | | 叢書名稱 | SpringerBriefs in Mathematics | | 圖書封面 |  | | 描述 | .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.. | | 出版日期 | Book 2016 | | 關(guān)鍵詞 | Connectivity of Graphs; open problems; conjectures; rainbow index of graphs; Steiner tree; edge-connectiv | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-319-33828-6 | | isbn_softcover | 978-3-319-33827-9 | | isbn_ebook | 978-3-319-33828-6Series ISSN 2191-8198 Series E-ISSN 2191-8201 | | issn_series | 2191-8198 | | copyright | The Author(s) 2016 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-15 07:49
發(fā)表于 2025-3-21 19:10:46
