Graph Theory with Applications to Engineering and Computer Science - Brossura

Narsingh Deo

Brossura

ISBN 10: 8120301455 ISBN 13: 9788120301450

Casa editrice: Prentice-Hall of India Pvt.Ltd, 2004

Riassunto

Because of its inherent simplicity, graph theory has a wide range of applications in engineering, and in physical sciences. It has of course uses in social sciences, in linguistics and in numerous other areas. In fact, a graph can be used to represent almost any physical situation involving discrete objects and the relationship among them. Now with the solutions to engineering and other problems becoming so complex leading to larger graphs, it is virtually difficult to analyze without the use of compute Table of Contents Preface. Introduction. Paths and Circuits. Trees and Fundamental Circuits. Cut-Sets and Cut-Vertices. Planar and Dual Graphs. Vector Spaces of a Graph. Matrix Representation of Graphs. Coloring, Covering, and Partitioning. Directed Graphs. Enumeration of Graphs. Graph Theoretic Algorithms and Computer Programs. Graphs in Switching and Coding Theory. Electrical Network Analysis by Graph Theory. Graph Theory in Operations Research. Survey of other Applications. APPENDIX A: Binet-Cauchy Theorem. APPENDIX B: Nullity of a Matrix and Sylvester's Law. Index

Su questo libro

Recensione

The writing is excellent. I got an introduction to graph theory from Mark Allen Weiss' "Data structures and algorithm analysis in C++". That was a very good start and led me to think I could use graph theory to solve a problem. When I needed to probe deeper I found this book in Weiss' bibliography. I read the first few chapters and felt comfortable enough to go out on the internet and find a PhD thesis that applied directly to my problem. --By A Customer on June 7, 2002

I was using this book as the first book for a Graph theory course and have choosen this from about 10 (pre-selected) books. It is interesting as it opens up new areas by solving interesting problems. I am not a professional in Graph Theory as i am doing Computer Science but i haven't found better introductory book so far. --By A Customer on October 13, 1999

Yes, this book exceeds my expectations. I'm finally back in the STEM swing and love the way Deo makes Diestal a lot easier or at least more concrete. Deistal , as you know is the German "go to guy" for hard hitting raw graph theory. Whereas Erdos is a global favorite. See also Proofs from THE BOOK 4th edition by Aigner and Ziegler. Wild open graphs are a favorite of mine, otherwise known as complex graphs. However letting your imagination run wild is important to seeing any asymmetrical graph in the REAL world, like stupid road maps that leave out critical details and get you lost or delayed or injured and left for dead. Google maps could use a few lessons from the above. Anyhow, Narsingh Deo's book is well worth the work thru, don't just skim it, or read it like a mystery novel: Interact with it! --By L. Hotchkiss on October 27, 2013

L'autore

Narsingh Deo is a professor and Charles N. Millican Endowed Chair of the Department of Computer Science, University of Central Florida. He received his Ph.D. for his dessertation 'Topological Analysis of Active Networks and Generalization of Hamiltonian tree' from Northwestern University, IL., in 1965; S. L. Hakimi was his advisor. Deo was professor at the Indian Institute of Technology, Kanpur.

Su questa edizione

• Editore: Prentice-Hall of India Pvt.Ltd
• Data di pubblicazione: 2004
• ISBN 10: 8120301455
• ISBN 13: 9788120301450
• Rilegatura: Copertina flessibile
• Numero di pagine: 496