Graph Theory with Applications to Engineering and Computer Science

This outstanding introductory treatment of graph theory and its applications has had a long life in the instruction of advanced undergraduates and graduate students in all areas that require knowledge of this subject. The first nine chapters constitute an excellent overall introduction, requiring only some knowledge of set theory and matrix algebra. Topics include paths and circuits, trees and fundamental circuits, planar and dual graphs, vector and matrix representation of graphs, and related subjects.
The remaining six chapters are more advanced, covering graph theory algorithms and computer programs, graphs in switching and coding theory, electrical network analysis by graph theory, graph theory in operations research, and more. Instructors may combine these chapters with the preceding material for courses in a variety of fields, including electrical engineering, computer science, operations research, and applied mathematics.

Narsingh Deo holds the Charles N. Millican Eminent Scholar's Chair in Computer Science and is the Director of the Center for Parallel Computation at the University of Central Florida, Orlando. Previously he was Professor of Computer Science at Washington State University, where he also served as the Department Chair.

Preface1. Introduction2. Paths and Circuits3. Trees and fundamental Circuits4. Cut-Sets and mCut-Vertices5. Planar and Dual graphs6. Vector spaces of a Graph7. Matrix Representation of graphs8. Coloring, Covering, and partioning9. Directed Graphs10. Enumeration mof Graphs11. Graph Theory Algorithims and Computer Programs12. Graphs in Switching  and Coding Theory13. Electrical Network Analysis by Graph Theory14. Graph Theory in Operations Research15. Survey of Other Applications Appendix A Binet-Cauchy TheoremAppendix B Nullity of a Matrix and Sylvester's LawIndex