Hybrid Graph Theory and Network Analysis

Contains work on applications of graph-theory to electrical network analysis.

Ladislav Novak (Author), Alan Gibbons (Author)

9780521461177, Cambridge University Press

Hardback, published 2 September 1999

188 pages
22.9 x 15.2 x 1.4 cm, 0.375 kg

"The book is well organized and presented, and is a welcome addition to the field." Mathematical Reviews

First published in 1999, this book combines traditional graph theory with the matroidal view of graphs and throws light on mathematical aspects of network analysis. This approach is called here hybrid graph theory. This is essentially a vertex-independent view of graphs naturally leading into the domain of graphoids, a generalisation of graphs. This enables the authors to combine the advantages of both the intuitive view from graph theory and the formal mathematical tools from the theory of matroids. A large proportion of the material is either new or is interpreted from a fresh viewpoint. Hybrid graph theory has particular relevance to electrical network analysis, which was one of the earliest areas of application of graph theory. It was essentially out of developments in this area that hybrid graph theory evolved.

Preface
1. Two dual structures of a graph
2. Independence structures
3. Basoids
4. Pairs of trees
5. Maximally distant pairs of trees
Bibliography
Index.

Subject Areas: Computer networking & communications [UT], Combinatorics & graph theory [PBV]