Professors frequently voice frustration over students’ preference for quick fixes, noting a heavy reliance on online summaries and videos. This habit often impedes genuine comprehension, especially in intricate subjects like graph theory, where thorough coverage is essential for genuine learning.
Graph theory requires a deep dive into interconnected topics, such as algorithms, network flows, connectivity, cycles, and paths, best facilitated by a single, comprehensive resource like a textbook.
Textbooks offer Comprehensive Coverage:
They guide structured learning from basics to advanced topics, essential for grasping complex subjects like engineering graph theory.
Textbooks offer Detailed Applications & Examples:
Realworld scenarios and case studies found in textbooks provide practical insights that online resources often lack. Students can learn practical applications of the concepts they are studying through the stepbystep approach of textbooks. Textbooks tend to cover every single concept possible (or almost everything) under the given topic, often following a systematic timeline or serially organized structure. This structured presentation helps students get a holistic view of the subject. In comparison, online study notes tend to provide only answers to exam questions and promote rote learning.
Textbooks offer Rigorous Mathematical Treatment:
The detailed explanations and proofs of mathematical problems found in textbooks empower readers to confidently tackle complex problems.
In my view, textbooks bridge the gap between rote learning and comprehensive understanding. Online resources may offer quick solutions, but textbooks provide the depth needed for practical application and true mastery of intricate subjects.
Embracing Textbooks for Practical Learning
Despite the allure of online resources, textbooks remain invaluable tools for mastering subjects like engineering graph theory. Their comprehensive coverage, practical examples, and rigorous treatment make them indispensable for anyone seeking a deeper understanding in a world of quick fixes found online.
Buy our book on graph theory from our website at 20% Off. 25%, if you are PHI BookClub member
https://www.phindia.com/Books/BookDetail/9788120301450/graphtheorywithapplicationstoengineeringandcomputer
]]>
Price: Rs. 525.00
ISBN: 9788120350977 Pages: 880 Binding: Paper Back Buy Now at www.phindia.com 

DESCRIPTION


Written with a strong pedagogical focus, this second edition of the book continues to provide an exhaustive presentation of the fundamental concepts of discrete mathematical structures and their applications in computer science and mathematics. It aims to develop the ability of the students to apply mathematical thought in order to solve computationrelated problems. The book is intended not only for the undergraduate and postgraduate students of mathematics but also, most importantly, for the students of Computer Science & Engineering and Computer Applications.
The introductory chapter presents an overview of the foundations of the subject, consisting of topics such as logic, set theory, relations, functions, algebraic structures, and graphs. The subsequent chapters provide detailed coverage of each of these topics as well as major areas of discrete mathematics such as combinatorics, lattices and Boolean algebras. Major applications such as computer models and computation, coding theory, cryptography and databases are dealt with in the final chapters of the book. In addition to this, a new chapter on matrices is included in this edition of the book, which forms a part of MCA course curriculum. The book is replete with features which enable the building of a firm foundation of the underlying principles of the subject and also provide adequate scope for testing the comprehension acquired by the students. Each chapter contains numerous workedout examples within the main discussion as well as several chapterend Supplementary Examples for revision. The SelfTest and Exercises at the end of each chapter provide large numbers of objective type questions and problems respectively. Answers to objective type questions and hints to exercises are also provided. All these pedagogic features, together with thorough coverage of the subject matter, make this book a readable text for beginners as well as advanced learners of the subject.


CONTENTS


Preface • Preface to the First Edition
1. Foundations 2. Predicate Calculus 3. Combinatorics 4. More on Sets 5. Relations and Functions 6. Recurrence Relations 7. Algebraic Structures 8. Lattices 9. Boolean Algebras 10. Graphs 11. Trees 12. Models of Computers and Computation 13. Additional Topics 14. matrices Further Readings< 

ABOUT THE AUTHOR(s)


N. Chandrasekaran, Ph.D., has been Professor of Mathematics at St. Joseph’s College, Tiruchirappalli. Prof. Chandrasekaran has many years of experience in teaching mathematics at the undergraduate and postgraduate levels in reputed institutions. He is the coauthor of Theory of Computer Science: Automata, Languages and Computation, published by PHI Learning, Delhi.
M. Umaparvathi, M.Phil., has been Professor of Mathematics at Seethalakshmi Ramaswami College, Tiruchirappalli. Prof. Umaparvathi has a decade of experience in teaching mathematics at the undergraduate and postgraduate levels. 

2015 / 880pp. / 17.8 x 23.5 cm / ISBN9788120350977 / Rs.525.00


PHI Learning Private Limited © 2011.
Email: phi@phindia.com For more information visit : www.phindia.com 