The book has many important features which make it suitable for both undergraduate and postgraduate students in various branches of engineering and general and applied sciences. The important topics interrelating Mathematics & Computer Science are also covered briefly. The book is useful to readers with a wide range of backgrounds including Mathematics, Computer Science/Computer Applications and Operational Research. While dealing with theorems and algorithms, emphasis is laid on constructions which consist of formal proofs, examples with applications. Uptill, there is scarcity of books in the open literature which cover all the things including most importantly various algorithms and applications with examples.
Author(s): Santanu Saha Ray
Edition: 1
Publisher: Springer
Year: 2012
Language: English
Pages: 232
City: New Delhi
Tags: Euler Graph; Hamiltonian Graph; Floyd-Warshall Algorithm; Ford-Fulkerson Algorithm; Graph Theory Textbook; Kuratowski Graphs; Prim Algorithm; Complexity
Graph Theorywith Algorithmsand its Applications
Preface
Acknowledgments
Contents
About the Author
1 Introduction to Graphs
2 Subgraphs, Paths, and Connected Graphs
3 EulerEuler Graphs and HamiltonianHamiltonian Graphs
4 Trees and FundamentalFundamental Circuits
5 Algorithms on Graphs
6 Matrix Representation on Graphs
7 Cut Sets and Cut Vertices
8 Coloring
9 Planar and Dual Graphs
10 Network Flows
Appendix
References
Index
