Skip to content
Register Sign in Wishlist

Hybrid Graph Theory and Network Analysis

$29.00 ( ) USD

Part of Cambridge Tracts in Theoretical Computer Science

  • Date Published: April 2011
  • availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
  • format: Adobe eBook Reader
  • isbn: 9780511885235

$ 29.00 USD ( )
Adobe eBook Reader

You will be taken to ebooks.com for this purchase
Buy eBook Add to wishlist

Other available formats:
Hardback, Paperback


Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    • Includes new results as well as synthesising and reworking last 30 years of research
    • Forms a bridge between traditional graph theory and the matroidal view of graphs, with applications in the hybrid analysis of networks
    • First book with this view of subject
    Read more

    Reviews & endorsements

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

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: April 2011
    • format: Adobe eBook Reader
    • isbn: 9780511885235
    • availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
  • Table of Contents

    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.

  • Authors

    Ladislav Novak, University of Novi Sad, Yugoslavia

    Alan Gibbons, King's College London

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×