Designed for undergraduate students of computer science, mathematics, and engineering, this book provides the tools and understanding needed to master graph theory and algorithms. It offers a strong theoretical foundation, detailed pseudocodes, and a range of real-world and illustrative examples to bridge the gap between abstract concepts and practical applications. Clear explanations and chapter-wise exercises support ease of comprehension for learners. The text begins with the basic properties of graphs and progresses to topics such as trees, connectivity, and distances in graphs. It also covers Eulerian and Hamiltonian graphs, matchings, planar graphs, and graph colouring. The book concludes with discussions on independent sets, the Ramsey theorem, directed graphs and networks. Concepts are introduced in a structured manner, with appropriate context and support from mathematical language and diagrams. Algorithms are explained through rules, reasoning, pseudocode, and relevant examples.
Sprache
Verlagsort
Zielgruppe
Für höhere Schule und Studium
Produkt-Hinweis
Illustrationen
Worked examples or Exercises
Maße
Höhe: 240 mm
Breite: 182 mm
Dicke: 13 mm
Gewicht
ISBN-13
978-1-009-55937-9 (9781009559379)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Klassifikation
T. Asir is currently working as Associate Professor, Department of Mathematics, Pondicherry University, Pondicherry.
Autor*in
Pondicherry University, Pondicherry
Lady Doak College, Madurai, Tamil Nadu
Swami Ramanand Teerth Marathwada University, Nanded, Maharasthra
Preface; 1. Introduction to graphs; 2. Basic properties of graphs; 3. Trees; 4. Connectivity; 5. Distance in Graphs; 6. Eulerian graphs and Hamiltonian graphs; 7. Matchings; 8. Planar graphs; 9. Coloring of Graphs; 10. Independent sets and Ramsey theory; 11. Directed Graphs; Bibliography; Index.
