Front Cover

pp.：  1 – 4

Graph Theory in Modern Engineering

pp.：  4 – 5

Copyright Page

pp.：  5 – 6

Contents

pp.：  6 – 10

Preface

pp.：  10 – 13

Acknowledgments

pp.：  13 – 14

Nomenclature

pp.：  14 – 18

Chapter 1. Basic Concepts

pp.：  18 – 24

Chapter 2. Construction and Analysis of Signal Flow Graphs

pp.：  24 – 40

Chapter 3. Systematic Analysis of Large Flow Graphs

pp.：  40 – 62

Chapter 4. Frequency Response Analysis

pp.：  62 – 70

Chapter 5. Sensitivity Analysis

pp.：  70 – 88

Chapter 6. Examples and Further Applications

pp.：  88 – 126

Chapter 7. Linear and Nonlinear Programming

pp.：  126 – 166

Chapter 8. Ranking by Flow-Graph Methods

pp.：  166 – 178

Chapter 9. Undirected Graphs

pp.：  178 – 192

Chapter 10. Matrix Representation of Graphs

pp.：  192 – 206

Chapter 11. Branch and Eound. Search Tree Methods

pp.：  206 – 240

Chapter 12. Process Reliability Analysis by Flow-Graph Methods

pp.：  240 – 262

Appendix A. Matrix Theory

pp.：  262 – 270

Appendix B. Linearization of Equations

pp.：  270 – 274

Appendix C. Derivation of Mason’s Rule

pp.：  274 – 282

Appendix D. Boolean and Modulo-2 Algebra

pp.：  282 – 286

Appendix E. Linear Programming

pp.：  286 – 294

Appendix F. The Coates Flow Graph

pp.：  294 – 298

Appendix G. The Fibonacci Search Method

pp.：  298 – 302

Appendix H. Glossary of Graph Nomenclature

pp.：  302 – 306

Appendix I. Computer Programs for Chapters 1-6

pp.：  306 – 310

Appendix J. Computer Programs for Chapter 7

pp.：  310 – 312

BIBLIOGRAPHY

pp.：  312 – 314

INDEX

pp.：  314 – 321