Algebraic graph theory / Norman Biggs.
Material type:
TextPublication details: Cambridge : Cambridge University Press 1993Edition: 2nd edDescription: vi, 205 p. ; 23 cmISBN: - 0521458978
- 9780521458979 (pbk)
- 511.5 20 B484
| Item type | Current library | Call number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|
Books
|
UE-Central Library | 511.5 B484 (Browse shelf(Opens below)) | Available | T13028 |
Browsing UE-Central Library shelves Close shelf browser (Hides shelf browser)
| 511.42 H1274 A primer on partial least squares structural equations modeling (PLS-SEM) | 511.5 A11 A Study of Hosoya Polynomial of Jahangir Graph | 511.5 An134 Analysis of graph based encyption schemes using matrices | 511.5 B484 Algebraic graph theory / | 511.5 C377 Charged anisotropic models in finch-skea spacetime | 511.5 C3857 Graphs and digraphs | 511.5 C3857 Introduction to graph theory |
1. Introduction to algebraic graph theory; Part I. Linear Algebra in Graphic Thoery: 2. The spectrum of a graph; 3. Regular graphs and line graphs; 4. Cycles and cuts; 5. Spanning trees and associated structures; 6. The tree-number; 7. Determinant expansions; 8. Vertex-partitions and the spectrum; Part II. Colouring Problems: 9. The chromatic polynomial; 10. Subgraph expansions; 11. The multiplicative expansion; 12. The induced subgraph expansion; 13. The Tutte polynomial; 14. Chromatic polynomials and spanning trees; Part III. Symmetry and Regularity: 15. Automorphisms of graphs; 16. Vertex-transitive graphs; 17. Symmetric graphs; 18. Symmetric graphs of degree three; 19. The covering graph construction; 20. Distance-transitive graphs; 21. Feasibility of intersection arrays; 22. Imprimitivity; 23. Minimal regular graphs with given girth; References; Index.
There are no comments on this title.
