Explorations in Algebraic Graph Theory with Sage

Explorations in Algebraic Graph Theory with Sage

This book provides a useful range of examples showing how Sage can be used in graph theory and combinatorics.

Tag(s): Graph Theory

Publication date: 31 Dec 2010

ISBN-10: n/a

ISBN-13: n/a

Paperback: n/a

Views: 2,736

Type: N/A

Publisher: n/a

License: GNU Free Documentation License Version 1.3

Post time: 03 May 2016 06:00:00

Explorations in Algebraic Graph Theory with Sage

Explorations in Algebraic Graph Theory with Sage This book provides a useful range of examples showing how Sage can be used in graph theory and combinatorics.
Tag(s): Graph Theory
Publication date: 31 Dec 2010
ISBN-10: n/a
ISBN-13: n/a
Paperback: n/a
Views: 2,736
Document Type: N/A
Publisher: n/a
License: GNU Free Documentation License Version 1.3
Post time: 03 May 2016 06:00:00
Summary/Excerpts of (and not a substitute for) the GNU Free Documentation License Version 1.3:
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled "GNU Free Documentation License".

Click here to read the full license.
From the Preface:
Chris Godsil and Rob Beezer wrote:These are my working notes on using Sage. One aim is to provide a useful range of examples showing how Sage can be used in graph theory and combinatorics.

Sage, and the packages it is built on, are the result of a lot of effort by a large number of people. I am hoping that these notes can also be viewed as a constructive "thank you." (CDG)

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. I am hoping these notes will provide a useful introduction for the student or researcher, while simultaneously aiding the continual improvement of Sage itself. (RAB)




About The Author(s)


Robert A. Beezer is a Professor of Mathematics at the University of Puget Sound, where he has been on the faculty since 1984. In addition to his teaching at the University of Puget Sound, he has made sabbatical visits to the University of the West Indies (Trinidad campus) and the University of Western Australia. He has also given several courses in the Master’s program at the African Institute for Mathematical Sciences, South Africa. He has been a Sage developer since 2008. He teaches calculus, linear algebra and abstract algebra regularly, while his research interests include the applications of linear algebra to graph theory.

Robert A. Beezer

Robert A. Beezer is a Professor of Mathematics at the University of Puget Sound, where he has been on the faculty since 1984. In addition to his teaching at the University of Puget Sound, he has made sabbatical visits to the University of the West Indies (Trinidad campus) and the University of Western Australia. He has also given several courses in the Master’s program at the African Institute for Mathematical Sciences, South Africa. He has been a Sage developer since 2008. He teaches calculus, linear algebra and abstract algebra regularly, while his research interests include the applications of linear algebra to graph theory.


Chris Godsil is a professor in Combinatorics and Optimization in the Math Faculty at the University of Waterloo. His research interests include Covers, Homomorphisms and Colorings, EKR Theorems, Complex Lines, and Graph Spectra.

Chris Godsil

Chris Godsil is a professor in Combinatorics and Optimization in the Math Faculty at the University of Waterloo. His research interests include Covers, Homomorphisms and Colorings, EKR Theorems, Complex Lines, and Graph Spectra.


Book Categories
Sponsors
Icons8, a free icon pack