Topics in Combinatorics and Graph Theory

R. Rama

ISBN 10: 3031742540 / ISBN 13: 9783031742545

Published by Springer, 2026

About this Item

Topics in Combinatorics and Graph Theory | R. Rama | Taschenbuch | x | Englisch | 2026 | Springer | EAN 9783031742545 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Seller Inventory # 135781654

Bibliographic Details

• Title: Topics in Combinatorics and Graph Theory
• Publisher: Springer
• Publication Date: 2026
• Language: English
• ISBN 10: 3031742540
• ISBN 13: 9783031742545
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 240W x 168H x 25D millimeters 240 millimeters width by 168 millimeters height by 25 millimeters depth
• Weight: 772 grams
• Seller catalogs:
  • Bücher

About this title

Synopsis

The book covers all the basics of both the topics. The topics are sequenced in such a manner that there is a flow in understanding the advances. The first and second chapters cover all the basic methods and tools for counting. Chapter 3 is on binomial theorem and binomial identities. Topics such as partitions, permutations on multisets, generating functions, recurrence relation, principle of inclusion exclusion, repeated counting, partially ordered sets and Mobius inversion, Polya's counting are covered in different chapters. Some basic chapters have some worked-out exercise. Information on Catalan numbers, Eulerian Numbers, Narayana Numbers, and Schroder Number are given in a chapter. The topic on "discrete probability" covers the connection between counting techniques and probability theory.

There second part of the book covers topics in graph theory such as basics of graphs, trees,bipartite graphs, matching , planar graphs, Euler and Hamilton graphs, graph coloring, Ramsey theory, spectral properties, and some graph algorithms.Adequate exercise and examples are provided so as to enhance the reader's interest and understanding. Some interesting concepts like high hamiltonicity, power of graphs, domination, and matrix tree theorem are introduced.

About the Author

Dr. R Rama holds a Ph.D. degree in Mathematics. She has over 32 years of teaching and research experience and has taught students at graduate and master’s levels at IIT Madras since 1995. She has guided eight Ph.D. students. At present, Dr. Rama is Girija Vaidyanathan Chair Professor at the Department of Mathematics, IIT Madras.She has co-authored a book on “Formal Languages and Automata Theory” that is widely used in Indian Universities either as textbook or as reference book, published by Pearson education in two languages, English and Chinese. She has also edited volumes on research articles for international publishers. She has presented her research papers in several national and international conferences. Her major area of interest and research is theoretical computer science.