7 Graph Theory
University of Oklahoma
DOI: 10.1201/9781315214023-7
Contents
- 7.1 Introduction
- 7.2 Basic Concepts
- 7.3 Cuts, Circuits, and Orthogonality
- 7.4 Incidence, Circuit, and Cut Matrices of a Graph
- 7.5 Orthogonality Relation and Ranks of Circuit and Cut Matrices
- 7.6 Spanning Tree Enumeration
- 7.7 Graphs and Electrical Networks
- 7.8 Tellegen’s Theorem and Network Sensitivity Computation
- 7.9 Arc Coloring Theorem and the No-Gain Property
- References
7.1 Introduction
Graph theory had its beginning in Euler’s solution of what is known as the Konigsberg Bridge problem. Kirchhoff developed the theory of trees in 1847 as a tool in the study of electrical networks. This was the first application of graph theory ...
Get Mathematics for Circuits and Filters now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
