Algebraic Graph Theory (Paperback, 2nd Revised edition)

In this substantial revision of a much-quoted monograph first published in 1974, Dr. Biggs aims to express properties of graphs in algebraic terms, then to deduce theorems about them. In the first section, 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 that 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. The structure of the volume 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 past twenty years. This new and enlarged edition will be essential reading for a wide range of mathematicians, computer scientists and theoretical physicists.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Series:	Cambridge Mathematical Library
Release date:	February 1994
First published:	1993
Authors:	Norman Biggs
Dimensions:	225 x 158 x 14mm (L x W x T)
Format:	Paperback - Trade
Pages:	216
Edition:	2nd Revised edition
ISBN-13:	978-0-521-45897-9
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Books > Science & Mathematics > Mathematics > Algebra > General Promotions
LSN:	0-521-45897-8
Barcode:	9780521458979

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!