# Algebraic Graph Theory (Cambridge Mathematical Library) by Norman Biggs

By Norman Biggs

it is a enormous revision of a much-quoted monograph, first released in 1974. The constitution is unchanged, however the textual content has been clarified and the notation introduced into line with present perform. a great number of 'Additional effects' are integrated on the finish of every bankruptcy, thereby overlaying many of the significant advances within the final two decades. Professor Biggs' easy goal continues to be to precise houses of graphs in algebraic phrases, then to infer theorems approximately them. within the first half, he tackles the functions of linear algebra and matrix idea to the learn of graphs; algebraic buildings similar to adjacency matrix and the occurrence matrix and their purposes are mentioned intensive. There follows an intensive account of the idea of chromatic polynomials, a subject matter which has powerful hyperlinks with the 'interaction types' studied in theoretical physics, and the idea of knots. The final half bargains with symmetry and regularity homes. right here there are very important connections with different branches of algebraic combinatorics and team concept. This new and enlarged variation this may be crucial interpreting for quite a lot of mathematicians, machine scientists and theoretical physicists.

Similar discrete mathematics books

Constrained Coding and Soft Iterative Decoding (The Springer International Series in Engineering and Computer Science)

Restricted Coding and smooth Iterative deciphering is the first paintings to mix the problems of restricted coding and tender iterative deciphering (e. g. , faster and LDPC codes) from a unified aspect of view. given that limited coding is established in magnetic and optical garage, it will be important to exploit a few distinct ideas (modified concatenation scheme or bit insertion) with a purpose to observe smooth iterative interpreting.

Multiobjective Programming and Planning (Dover Books on Computer Science)

This article takes a wide view of multiobjective programming, emphasizing the tools most valuable for non-stop difficulties. It studies multiobjective programming equipment within the context of public decision-making difficulties, constructing every one challenge inside a context that addresses sensible elements of making plans matters.

Stochastic Local Search: Foundations and Applications (The Morgan Kaufmann Series in Artificial Intelligence)

Stochastic neighborhood seek (SLS) algorithms are one of the such a lot fashionable and winning recommendations for fixing computationally tricky difficulties in lots of components of desktop technological know-how and operations examine, together with propositional satisfiability, constraint delight, routing, and scheduling. SLS algorithms have additionally turn into more and more well known for fixing hard combinatorial difficulties in lots of program components, reminiscent of e-commerce and bioinformatics.

An Introduction to Numerical Computation

Constructed in the course of ten years of training event, this booklet serves as a collection of lecture notes for an introductory path on numerical computation, on the senior undergraduate point. those notes include the fabric that may be coated in a semester, including a number of non-compulsory sections for extra examining.

Extra resources for Algebraic Graph Theory (Cambridge Mathematical Library)

Sample text