A first course in graph theory and combinatorics [electronic resource]
- 作者： Cioaba, Sebastian M.
- 其他作者：
- 其他題名：
- Texts and readings in mathematics ;
- 出版： Singapore : Springer Nature Singapore :Imprint: Springer
- 版本：Second edition.
- 叢書名： Texts and readings in mathematics,v. 55
- 主題： Graph theory. , Combinatorial analysis. , Graph Theory. , Group Theory and Generalizations.
- ISBN： 9789811909573 (electronic bk.) 、 9789811913358 (paper)
-
FIND@SFXID:
CGU
- 資料類型: 電子書
- 內容註: Chapter 1. Basic Graph Theory -- Chapter 2. Basic Counting -- Chapter 3. The Principle of Inclusion and Exclusion -- Chapter 4. Graphs and Matrices -- Chapter 5. Trees -- Chapter 6. M‥obius Inversion and Graph Colouring -- Chapter 7. Enumeration under Group Action -- Chapter 8. Matching Theory -- Chapter 9. Block Designs -- Chapter 10. Planar Graphs -- Chapter 11. Edges and Cycles -- Chapter 12. Expanders and Ramanujan Graphs -- Chapter 13. Hints.
- 摘要註: This book discusses the origin of graph theory from its humble beginnings in recreational mathematics to its modern setting or modeling communication networks, as is evidenced by the World Wide Web graph used by many Internet search engines. The second edition of the book includes recent developments in the theory of signed adjacency matrices involving the proof of sensitivity conjecture and the theory of Ramanujan graphs. In addition, the book discusses topics such as Pick's theorem on areas of lattice polygons and Graham-Pollak's work on addressing of graphs. The concept of graph is fundamental in mathematics and engineering, as it conveniently encodes diverse relations and facilitates combinatorial analysis of many theoretical and practical problems. The text is ideal for a one-semester course at the advanced undergraduate level or beginning graduate level.
-
讀者標籤：
- 系統號： 005516418 | 機讀編目格式
館藏資訊
This book discusses the origin of graph theory from its humble beginnings in recreational mathematics to its modern setting or modeling communication networks, as is evidenced by the World Wide Web graph used by many Internet search engines. The second edition of the book includes recent developments in the theory of signed adjacency matrices involving the proof of sensitivity conjecture and the theory of Ramanujan graphs. In addition, the book discusses topics such as Pick’s theorem on areas of lattice polygons and Graham–Pollak’s work on addressing of graphs. The concept of graph is fundamental in mathematics and engineering, as it conveniently encodes diverse relations and facilitates combinatorial analysis of many theoretical and practical problems. The text is ideal for a one-semester course at the advanced undergraduate level or beginning graduate level.