Amazon cover image
Image from Amazon.com

Algebraic graph theory

By: Material type: TextTextLanguage: English Series: Cambridge Mathematical LibraryPublication details: Cambridge : Cambridge University Press, 2018.Edition: 2ndDescription: vii, 205pISBN:
  • 1316616916
  • 9781316616918
Subject(s): DDC classification:
  • 511.5 BIG-A
Online resources:
Contents:
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.
Summary: This is a substantial revision of a much-quoted monograph, first published in 1974. The structure is unchanged, but the text has been clarified and the notation brought into line with current practice. A large number of 'Additional Results' are included at the end of each chapter, thereby covering most of the major advances in the last twenty years. Professor Biggs' basic aim remains to express properties of graphs in algebraic terms, then to deduce theorems about them. In the first part, he tackles the applications of linear algebra and matrix theory to the study of graphs; algebraic constructions such as adjacency matrix and the incidence matrix and their applications are discussed in depth. There follows an extensive account of the theory of chromatic polynomials, a subject which has strong links with the 'interaction models' studied in theoretical physics, and the theory of knots. The last part deals with symmetry and regularity properties. Here there are important connections with other branches of algebraic combinatorics and group theory. This new and enlarged edition this will be essential reading for a wide range of mathematicians, computer scientists and theoretical physicists.
Item type: Books and Monographs
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Collection Call number Materials specified Status Date due Barcode
Books and Monographs Central Library, NIT Jalandhar Central Library, NIT Jalandhar Mathematics and Computing 511.5 BIG-A (Browse shelf(Opens below)) Available 102919

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.

This is a substantial revision of a much-quoted monograph, first published in 1974. The structure is unchanged, but the text has been clarified and the notation brought into line with current practice. A large number of 'Additional Results' are included at the end of each chapter, thereby covering most of the major advances in the last twenty years. Professor Biggs' basic aim remains to express properties of graphs in algebraic terms, then to deduce theorems about them. In the first part, he tackles the applications of linear algebra and matrix theory to the study of graphs; algebraic constructions such as adjacency matrix and the incidence matrix and their applications are discussed in depth. There follows an extensive account of the theory of chromatic polynomials, a subject which has strong links with the 'interaction models' studied in theoretical physics, and the theory of knots. The last part deals with symmetry and regularity properties. Here there are important connections with other branches of algebraic combinatorics and group theory. This new and enlarged edition this will be essential reading for a wide range of mathematicians, computer scientists and theoretical physicists.

Dr. Sanjeev, Librarian
Managed by: Dr. D. P. Tripathi, Deputy Librarian, Central Library
For any query / question, please mail at circulation.liby@nitj.ac.in 

Powered by Koha