This book is intended to provide a series of illustrations of how the package Sage can be used to work on problems in algebraic graph theory. Algebraic graph theory is a beautiful subject and Sage is an ideal place to experiment with the relevant mathematics: graph theory, linear algebra and permutation groups, along with combinatorics generally. We hope these notes will provide a useful introduction for student and for researchers, and that they will simultaneously assist in the continual improvement of Sage.
The topics we have chosen are meant to be interesting—they are for us—and to provide cases where computations in Sage will be useful. We do not offer a course in programming: we assume a minimal level of familiarity with Sage, but we have tried to illustrate a wide range of different computational techniques. As for mathematical background, the reader will need a basic understanding of graphs, linear algebra and the like. We view each topic (or exploration) as a starting point and we hope that some of our readers are encouraged to go elsewhere to learn more.
Since neither publishers nor trees are involved in the production of this text, it will be easy for us to add to add new chapters from time to time, and we hope to do so. We will be happy to accept contributions from other authors. These should agree in spirit with what is already here, and adhere to our stylistic standards. We recommend strongly that anyone interested contact us before investing any significant effort. (Our view of what constitutes “algebraic graph theory” is quite broad.)