Prêtable
| Titre : | Graph theory with applications to engineering and computer science |
| Titre original: | Théorie graphique avec des applications à l’ingénierie et à l’informatique |
| Auteurs : | Narsingh Deo |
| Type de document : | texte imprimé |
| Editeur : | London [U.K] : Prentice-hall International, 1974 |
| ISBN/ISSN/EAN : | 978-0-13-363473-0 |
| Format : | XVII-478 p. / ill.; couv. en coul. / 24 cm. |
| Langues: | Anglais |
| Langues originales: | Anglais |
| Index. décimale : | 518.23 (Méthodes graphiques (nomographie)) |
| Catégories : | |
| Mots-clés: | Circuits ; Graphes ; Computer science ; Graphs |
| Résumé : |
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
|
| Note de contenu : |
Sommaire :
Chapitre 1: Paths and circuits Chapitre 2: Trees and fundamental circuits Chapitre 3: Cutsets and cut vertices Chapitre 4: Planar and dual graphs Chapitre 5: Vector spaces of a graph Chapitre 6: Matrix representation of graphs Chapitre 7: Coloring,covering,and partitioning Chapitre 8: Directed graphd graphs Chapitre 9: Enumeration of graphs Chapitre 10: Graph theoretic algorithms and computer programs Chapitre 11: Graphs in switching and coding theory Chapitre 12: Electrical network analysis by gaph theory Chapitre 13: Graph theory in operations research Chapitre 14: Survey of other applications |
Exemplaires (1)
| Cote | Support | Localisation | Section | Disponibilité |
|---|---|---|---|---|
| T8/310 | Livre | Bibliothèque de la Faculté de Technologie | Section documentaire | Disponible |
