Buch, Englisch, Band 49, 186 Seiten, Format (B × H): 157 mm x 235 mm, Gewicht: 431 g
Buch, Englisch, Band 49, 186 Seiten, Format (B × H): 157 mm x 235 mm, Gewicht: 431 g
Reihe: Cambridge Tracts in Theoretical Computer Science
ISBN: 978-0-521-46117-7
Verlag: Cambridge University Press
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. The book will be regarded as a substantial account of the subject. Suitable readers will be engineering theorists, computer scientists and mathematicians.
Autoren/Hrsg.
Fachgebiete
Weitere Infos & Material
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.
