 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
|
|
|
A Tour through Graph Theory, 2 ed◆Taylor & Francisセール開催中！：2026年12月20日(日)ご注文分まで
※上記表示の販売価格は割引適用後の価格です 出版済み 3-5週間でお届けいたします。 Title: A Tour through Graph Theory, 2 ed Series: Textbooks in Mathematics Author: Saoub, Karin R. Publisher: Taylor & Francis ISBN: 9781032855455 Cover: HARDCOVER Date: 2026年06月 こちらの商品は学校・法人様向け（機関契約）のオンラインブック版がございます。 オンラインブックの価格、納期につきましては弊社営業員または当ECサイトよりお問い合わせください。  DESCRIPTION Graph theory is an area of mathematics that can challenge one's notions of what mathematics is and can be. The author discovered this as a student, as her discovery led her to pursue an advanced degree in mathematics. In A Tour through Graph Theory, Second Edition, the author shares her enthusiasm for the topic with students assuming only high school mathematics experience. The book introduces graph theory to students who are not mathematics majors. To distinguish itself from others covering the same topic, the book: Employs graph theory to teach mathematical reasoning Promotes critical thinking and problem solving Provides rich examples and clear explanations without using proofs Includes thoughtful discussions of historical problems and modern questions New to this edition, the author offers more explanation for concepts or adds more context for the topics. Significant care was taken in modifying the description and examples for the more complex algorithms and theoretical discussions. More than 40 new exercises have been added, and 50 additional graphs have been added to existing exercises to provide more options for homework or quiz problems. This book is intended to strike a balance between focusing on the theory and exploration of proof techniques and the algorithmic aspect of graph theory. Explanations and logical reasoning for solutions, but no formal mathematical proofs, are provided. Each chapter includes problems to test understanding of the material and can be used for homework, quiz problems, or self-study. TABLE OF CONTENTS Part 1: Graph Models and Routes 1. Eulerian Tours 1.1 Königsberg Bridge Problem 1.2 Introduction to Graph Models 1.3 Touring a Graph 1.4 Eulerian Circuit Algorithms 1.5 Eulerization 1.6 Exercises 2. Hamiltonian Cycles 2.1 Existence of a Hamiltonian Cycle 2.2 Traveling Salesman Problem 2.3 Digraphs 2.4 Exercises 3. Paths 3.1 Shortest Paths 3.2 Project Scheduling 3.3 Exercises 4. Additional Topics in Graph Routes 4.1 Tournaments 4.2 Flow and Capacity 4.3 Matrix Representation 4.4 Algorithm Efficiency 4.5 Exercises Part 2: Graph Structure 5. Trees and Networks 5.1 Trees 5.2 Spanning Trees 5.3 Shortest Networks 5.4 Traveling Salesman Problem Revisited 5.5 Exercises 6. Matching 6.1 Bipartite Graphs 6.2 Matching Terminology and Strategies 6.3 Stable Matching 6.4 Matchings in Non-Bipartite Graphs 6.5 Exercises 7. Graph Coloring 7.1 Four Color Theorem 7.2 Coloring Bounds 7.3 Coloring Strategies 7.4 Perfect Graphs 7.5 Weighted Coloring 7.6 Exercises 8. Additional Topics in Graph Structure 8.1 Graph Isomorphism 8.2 Rooted Trees 8.3 Planarity 8.4 Edge-Coloring 8.5 Exercises Appendix A Set Theory B Functions C Matrix Operations 最近チェックした商品
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
