Chris Godsil
Chris D. Godsil | |
|---|---|
| Alma mater | University of Melbourne |
| Known for | Algebraic combinatorics |
| Scientific career | |
| Fields | Mathematics |
| Institutions | University of Waterloo |
| Doctoral advisor | Derek Alan Holton |
Christopher David Godsil is a professor and the former Chair at the Department of Combinatorics and Optimization in the faculty of mathematics at the University of Waterloo. He wrote the popular textbook on algebraic graph theory, entitled Algebraic Graph Theory, with Gordon Royle,[1] His earlier textbook on algebraic combinatorics discussed distance-regular graphs and association schemes.[2]
Background
[edit]He started the Journal of Algebraic Combinatorics, and was the Editor-in-Chief of the Electronic Journal of Combinatorics from 2004 to 2008. He is also on the editorial board of the Journal of Combinatorial Theory Series B and Combinatorica.[3]
He obtained his Ph.D. in 1979 at the University of Melbourne under the supervision of Derek Alan Holton.[4] He wrote a paper with Paul Erdős, so making his Erdős number equal to 1.[5]
Notes
[edit]- ^ Robin J. Wilson's review of Godsil & Royle (2004) for Mathematical Reviews (MR1829620).
- ^ Andrew Woldar's review of Godsil (1993) for Mathematical Reviews (MR1220704).
- ^ Chris Godsil's CV Archived May 14, 2010, at the Wayback Machine.
- ^ Chris Godsil at the Mathematics Genealogy Project.
- ^ Paul Erdős, Chris D. Godsil, S. G. Krantz, and T. D. Parsons, "Intersection graphs for families of balls in $R\sp n$." European J. Combin. 9(5), pp. 501-505, (1988).
References
[edit]- Godsil, C. D. (1993). Algebraic combinatorics. Chapman and Hall Mathematics Series. New York: Chapman and Hall. pp. xvi+362. ISBN 0-412-04131-6. MR 1220704.
- Godsil, Chris; Royle, Gordon (2004). Algebraic graph theory. New York: Springer-Verlag. ISBN 0-387-95241-1. MR 1829620.
| International | |
|---|---|
| National | |
| Academics | |
| People | |
| Other | |
 | This article about a mathematician is a stub. You can help Wikipedia by expanding it. |