Welcome to UE Central Library

Keep Smiling

Algebraic graph theory / Norman Biggs.

By: Material type: TextPublication details: Cambridge : Cambridge University Press 1993Edition: 2nd edDescription: vi, 205 p. ; 23 cmISBN:
  • 0521458978
  • 9780521458979 (pbk)
Subject(s): DDC classification:
  • 511.5 20 B484
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.
List(s) this item appears in: Mathematics
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Cover image Item type Current library Home library Collection Shelving location Call number Materials specified Vol info URL Copy number Status Notes Date due Barcode Item holds Item hold queue priority Course reserves
Books UE-Central Library 511.5 B484 (Browse shelf) Available T13028

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.

to post a comment.
Copyright © 2023, University of Education, Lahore. All Rights Reserved.
Email:centrallibrary@ue.edu.pk