Algebraic Graph Theory

Name: Algebraic Graph Theory
Price: 41.81 USD
Availability: InStock
ISBN: 9780521458979

ISBN-10: 0521458978

ISBN-13: 9780521458979

Edition: 2nd (Revised)

Authors: Norman L. Biggs

List price: $71.99

This item qualifies for FREE shipping.

30 day, 100% satisfaction guarantee!

Sell

Get cash fast!

Buy new: $56.56

Marketplace

3 new & used from $41.81

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

Description:

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.…

Book details

List price: $71.99
Edition: 2nd
Publisher: Cambridge University Press
Publication date: 2/3/1994
Binding: Paperback
Pages: 216
Size: 6.22" wide x 8.86" long x 0.55" tall
Weight: 0.682
Language: English




Introduction to algebraic graph theory



Linear Algebra in Graphic Thoery



The spectrum of a graph



Regular graphs and line graphs



Cycles and cuts



Spanning trees and associated structures



The tree-number



Determinant expansions



Vertex-partitions and the spectrum



Colouring Problems



The chromatic polynomial



Subgraph expansions



The multiplicative expansion



The induced subgraph expansion



The Tutte polynomial



Chromatic polynomials and spanning trees



Symmetry and Regularity



Automorphisms of graphs



Vertex-transitive graphs



Symmetric graphs



Symmetric graphs of degree three



The covering graph construction



Distance-transitive graphs



Feasibility of intersection arrays



Imprimitivity



Minimal regular graphs with given girth


References


Index