東華大學圖書館 |

Graph and network theory = an applied approach using mathematica /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Graph and network theory/ by Michael A. Henning, Jan H. van Vuuren.
其他題名:	an applied approach using mathematica /
作者:	Henning, Michael A.
其他作者:	van Vuuren, Jan H.
出版者:	Cham :Springer International Publishing : : 2022.,
面頁冊數:	xxix, 766 p. :ill. (some col.), digital ;24 cm.
內容註:	Preface -- List of Algorithms -- List of Bibliographical Notes -- Part 1. Topics in network optimisation -- 1. An introduction to graphs -- 2. Graph connectedness -- 3. Algorithmic complexity -- 4. Optimal paths -- 5. Trees -- 6. Location problems -- 7. Maximum flow networks -- 8. Minimum-cost network flows -- Part 2. Topics in classical graph theory -- 9. Matchings -- 10. Eulerian graphs -- 11. Hamiltonian graphs -- 12. Graph connectivity -- 13. Planarity -- 14. Graph colouring -- 15. Oriented graphs. Part 3. Topics in modern graph theory -- 16. Domination in graphs -- 17. Ramsey Theory -- 18. Extremal graph theory -- 19. Graph enumeration -- 20. The probabilistic method -- Index.
Contained By:	Springer Nature eBook
標題:	Graph theory. -
電子資源:	https://doi.org/10.1007/978-3-031-03857-0
ISBN:	9783031038570

Graph and network theory = an applied approach using mathematica /
Henning, Michael A.

Graph and network theoryan applied approach using mathematica /[electronic resource] :by Michael A. Henning, Jan H. van Vuuren. - Cham :Springer International Publishing :2022. - xxix, 766 p. :ill. (some col.), digital ;24 cm. - Springer optimization and its applications,v. 1931931-6836 ;. - Springer optimization and its applications ;v. 193..

Preface -- List of Algorithms -- List of Bibliographical Notes -- Part 1. Topics in network optimisation -- 1. An introduction to graphs -- 2. Graph connectedness -- 3. Algorithmic complexity -- 4. Optimal paths -- 5. Trees -- 6. Location problems -- 7. Maximum flow networks -- 8. Minimum-cost network flows -- Part 2. Topics in classical graph theory -- 9. Matchings -- 10. Eulerian graphs -- 11. Hamiltonian graphs -- 12. Graph connectivity -- 13. Planarity -- 14. Graph colouring -- 15. Oriented graphs. Part 3. Topics in modern graph theory -- 16. Domination in graphs -- 17. Ramsey Theory -- 18. Extremal graph theory -- 19. Graph enumeration -- 20. The probabilistic method -- Index.

This textbook covers a diversity of topics in graph and network theory, both from a theoretical standpoint, and from an applied modelling point of view. Mathematica is used to demonstrate much of the modelling aspects. Graph theory and model building tools are developed in tandem with effective techniques for solving practical problems via computer implementation. The book is designed with three primary readerships in mind. Individual syllabi or suggested sequences for study are provided for each of three student audiences: mathematics, applied mathematics/operations research, and computer science. In addition to the visual appeal of each page, the text contains an abundance of gems. Most chapters open with real-life problem descriptions which serve as motivation for the theoretical development of the subject matter. Each chapter concludes with three different sets of exercises. The first set of exercises are standard and geared toward the more mathematically inclined reader. Many of these are routine exercises, designed to test understanding of the material in the text, but some are more challenging. The second set of exercises is earmarked for the computer technologically savvy reader and offer computer exercises using Mathematica. The final set consists of larger projects aimed at equipping those readers with backgrounds in the applied sciences to apply the necessary skills learned in the chapter in the context of real-world problem solving. Additionally, each chapter offers biographical notes as well as pictures of graph theorists and mathematicians who have contributed significantly to the development of the results documented in the chapter. These notes are meant to bring the topics covered to life, allowing the reader to associate faces with some of the important discoveries and results presented. In total, approximately 100 biographical notes are presented throughout the book. The material in this book has been organized into three distinct parts, each with a different focus. The first part is devoted to topics in network optimization, with a focus on basic notions in algorithmic complexity and the computation of optimal paths, shortest spanning trees, maximum flows and minimum-cost flows in networks, as well as the solution of network location problems. The second part is devoted to a variety of classical problems in graph theory, including problems related to matchings, edge and vertex traversal, connectivity, planarity, edge and vertex coloring, and orientations of graphs. Finally, the focus in the third part is on modern areas of study in graph theory, covering graph domination, Ramsey theory, extremal graph theory, graph enumeration, and application of the probabilistic method.

ISBN: 9783031038570

Standard No.: 10.1007/978-3-031-03857-0doiSubjects--Uniform Titles:

Mathematica (Computer file)
Subjects--Topical Terms:

523815
Graph theory.

LC Class. No.: QA166

Dewey Class. No.: 511.5

Graph and network theory = an applied approach using mathematica /
LDR:04524nmm a2200337 a 4500 001 2300724
003 DE-He213
005 20220603155114.0
006 m d
007 cr nn 008maaau
008 230324s2022 sz s 0 eng d
020 $a 9783031038570 $q (electronic bk.)
020 $a 9783031038563 $q (paper)
024 7 $a 10.1007/978-3-031-03857-0 $2 doi
035 $a 978-3-031-03857-0
040 $a GP $c GP
041 0 $a eng
050 4 $a QA166
072 7 $a KJT $2 bicssc
072 7 $a BUS049000 $2 bisacsh
072 7 $a KJT $2 thema
082 0 4 $a 511.5 $2 23
090 $a QA166 $b .H517 2022
100 1 $a Henning, Michael A. $3 3461646
245 1 0 $a Graph and network theory $h [electronic resource] : $b an applied approach using mathematica / $c by Michael A. Henning, Jan H. van Vuuren.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a xxix, 766 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Springer optimization and its applications, $x 1931-6836 ; $v v. 193
505 0 $a Preface -- List of Algorithms -- List of Bibliographical Notes -- Part 1. Topics in network optimisation -- 1. An introduction to graphs -- 2. Graph connectedness -- 3. Algorithmic complexity -- 4. Optimal paths -- 5. Trees -- 6. Location problems -- 7. Maximum flow networks -- 8. Minimum-cost network flows -- Part 2. Topics in classical graph theory -- 9. Matchings -- 10. Eulerian graphs -- 11. Hamiltonian graphs -- 12. Graph connectivity -- 13. Planarity -- 14. Graph colouring -- 15. Oriented graphs. Part 3. Topics in modern graph theory -- 16. Domination in graphs -- 17. Ramsey Theory -- 18. Extremal graph theory -- 19. Graph enumeration -- 20. The probabilistic method -- Index.
520 $a This textbook covers a diversity of topics in graph and network theory, both from a theoretical standpoint, and from an applied modelling point of view. Mathematica is used to demonstrate much of the modelling aspects. Graph theory and model building tools are developed in tandem with effective techniques for solving practical problems via computer implementation. The book is designed with three primary readerships in mind. Individual syllabi or suggested sequences for study are provided for each of three student audiences: mathematics, applied mathematics/operations research, and computer science. In addition to the visual appeal of each page, the text contains an abundance of gems. Most chapters open with real-life problem descriptions which serve as motivation for the theoretical development of the subject matter. Each chapter concludes with three different sets of exercises. The first set of exercises are standard and geared toward the more mathematically inclined reader. Many of these are routine exercises, designed to test understanding of the material in the text, but some are more challenging. The second set of exercises is earmarked for the computer technologically savvy reader and offer computer exercises using Mathematica. The final set consists of larger projects aimed at equipping those readers with backgrounds in the applied sciences to apply the necessary skills learned in the chapter in the context of real-world problem solving. Additionally, each chapter offers biographical notes as well as pictures of graph theorists and mathematicians who have contributed significantly to the development of the results documented in the chapter. These notes are meant to bring the topics covered to life, allowing the reader to associate faces with some of the important discoveries and results presented. In total, approximately 100 biographical notes are presented throughout the book. The material in this book has been organized into three distinct parts, each with a different focus. The first part is devoted to topics in network optimization, with a focus on basic notions in algorithmic complexity and the computation of optimal paths, shortest spanning trees, maximum flows and minimum-cost flows in networks, as well as the solution of network location problems. The second part is devoted to a variety of classical problems in graph theory, including problems related to matchings, edge and vertex traversal, connectivity, planarity, edge and vertex coloring, and orientations of graphs. Finally, the focus in the third part is on modern areas of study in graph theory, covering graph domination, Ramsey theory, extremal graph theory, graph enumeration, and application of the probabilistic method.
630 0 0 $a Mathematica (Computer file) $3 524926
650 0 $a Graph theory. $3 523815
650 1 4 $a Operations Research, Management Science. $3 1532996
650 2 4 $a Graph Theory. $3 1567033
650 2 4 $a Applications of Discrete Mathematics. $3 3599507
700 1 $a van Vuuren, Jan H. $3 3599505
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Springer optimization and its applications ; $v v. 193. $3 3599506
856 4 0 $u https://doi.org/10.1007/978-3-031-03857-0
950 $a Mathematics and Statistics (SpringerNature-11649)