Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks
Title
A first course in graph theory and combinatorics / Sebastian M. Cioaba, M. Ram Murty.
Edition
Second edition.
ISBN
9789811909573 (electronic bk.)
9811909571 (electronic bk.)
9789811913358
9811913358
Published
Singapore : Springer ; New Delhi : Hindustan Book Agency, [2022]
Copyright
©2022
Language
English
Description
1 online resource : illustrations.
Other Standard Identifiers
10.1007/978-981-19-0957-3 doi
Call Number
QA166
Dewey Decimal Classification
511/.5
Summary
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 Picks theorem on areas of lattice polygons and GrahamPollaks 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.
Bibliography, etc. Note
Includes bibliographical references and index.
Access Note
Access limited to authorized users.
Source of Description
Online resource; title from PDF title page (SpringerLink, viewed July 13, 2022).
Series
Texts and readings in mathematics ; 55. 2366-8725
Available in Other Form
Print version: 9789811913358
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.
