Hybrid Graph Theory and Network Analysis (Cambridge Tracts in Theoretical Computer Science)

Ladislav Novak

ISBN 10: 0521106591 / ISBN 13: 9780521106597

Published by Cambridge University Press 2009-08-04, 2009

About this Item

Seller Inventory # 6666-IUK-9780521106597

Bibliographic Details

• Title: Hybrid Graph Theory and Network Analysis (Cambridge Tracts in Theoretical Computer Science)
• Publisher: Cambridge University Press 2009-08-04
• Publication Date: 2009
• Language: English
• ISBN 10: 0521106591
• ISBN 13: 9780521106597
• Binding: Paperback
• Condition: New

About this title

Synopsis

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.

Book 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 include many new results as well as synthesising and reworking much research done over the last 30 years. It will be regarded as the definitive account of the subject, suitable for all working in theoretical network analysis, whether they be mathematicians, computer scientists or electrical engineers.