000 | 01583nam a22002537a 4500 | ||
---|---|---|---|
005 | 20240207103957.0 | ||
008 | 240207b |||||||| |||| 00| 0 eng d | ||
020 | _a9780521106597 | ||
082 |
_a511.5 _bNOV |
||
100 |
_aNovak, Ladislav _915207 |
||
245 | _aHybrid graph theory and network analysis | ||
260 |
_bCambridge University Press _aCambridge _c1999 |
||
300 | _ax, 176 p. | ||
365 |
_aGBP _b27.99 |
||
520 | _aFirst 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. | ||
650 |
_aGraph theory _915208 |
||
650 |
_aNetwork analysis _915209 |
||
650 |
_aCommunication -- Network analysis _915210 |
||
650 |
_aGraph theory _915208 |
||
650 |
_aNetwork analysis (Planning) _915211 |
||
650 |
_aCommunication -- Network analysis _915210 |
||
700 |
_aGibbons, Alan _915212 |
||
942 |
_cBK _2ddc |
||
999 |
_c5727 _d5727 |