Features
- Cover Type: Hard Cover with 186 pages
- Published by: Cambridge University Press September 28, 1999
- Written in: English
- ISBN 10 Number: 0521461170
- ISBN 13 Number: 978-0521461177
-
Book Dimensions:
9 x 6.1 x 0.6 inches
- Weighs: 14.9 ounces
Product Review
"The book is well organized and presented, and is a welcome addition to the field." Mathematical Reviews
Product Description
This book combines traditional graph theory with the matroid view of graphs in order to throw light on the mathematical approach to network analysis. The authors examine in detail two dual structures associated with a graph, namely circuits and cutsets. These are strongly dependent on one another and together constitute a third, hybrid, vertex-independent structure called a graphoid, whose study is here termed hybrid graph theory. This approach has particular relevance for network analysis. The first account of the subject in book form, the text includes many new results as well as the synthesizing and reworking of much research done over the past thirty years (historically, the study of hybrid aspects of graphs owes much to the foundational work of Japanese researchers). This work will be regarded as the definitive account of the subject, suitable for all working in theoretical network analysis: mathematicians, computer scientists or electrical engineers.
Search for books at
