A first course in graph theory and combinatorics

著者

書誌事項

A first course in graph theory and combinatorics

Sebastian M. Cioabă, M. Ram Murty

(Texts and readings in mathematics, 55)

Hindustan Book Agency , Springer, c2022

2nd ed

大学図書館所蔵 件 / 8

この図書・雑誌をさがす

注記

Includes bibliographical references and index

内容説明・目次

内容説明

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.

目次

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. Mobius 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.

「Nielsen BookData」 より

関連文献: 1件中  1-1を表示

詳細情報

  • NII書誌ID(NCID)
    BC14261124
  • ISBN
    • 9789811913358
  • 出版国コード
    ii
  • タイトル言語コード
    eng
  • 本文言語コード
    eng
  • 出版地
    New Delhi,Singapore
  • ページ数/冊数
    xv, 222 p.
  • 大きさ
    25 cm
  • 分類
  • 件名
  • 親書誌ID
ページトップへ