Chris Godsil

Chris Godsil
Chris D. Godsil
Residence Waterloo, ON
Fields Mathematics
Institutions University of Waterloo
Alma mater University of Melbourne
Doctoral advisor Derek Alan Holton
Known for Algebraic combinatorics

Christopher David Godsil is a professor 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] 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

  1. ^ Robin J. Wilson's review of Godsil & Royle (2004) for Mathematical Reviews (MR1829620).
  2. ^ Andrew Woldar's review of Godsil (1993) for Mathematical Reviews (MR1220704).
  3. ^ Chris Godsil's CV.
  4. ^ Chris Godsil at the Mathematics Genealogy Project..
  5. ^ 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

  • Godsil, C. D. (1993). Algebraic combinatorics. Chapman and Hall Mathematics Series. New York: Chapman and Hall. pp. xvi+362. ISBN 0-412-04131-6. MR1220704. 
  • Godsil, Chris; Royle, Gordon (2004). Algebraic graph theory. New York: Springer-Verlag. ISBN 0-387-95241-1. MR1829620. 

References



Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • Apoorva D. Patel — Infobox Scientist box width = 300px name = Apoorva Patel image size = 300px caption = birth date = birth place = death date = death place = residence = India citizenship = nationality = Indian ethnicity = fields = Physicist workplaces = Indian… …   Wikipedia

  • Strongly regular graph — Let G = (V,E) be a regular graph with v vertices and degree k . G is said to be strongly regular if there are also integers λ and μ such that:* Every two adjacent vertices have λ common neighbours.* Every two non adjacent vertices have μ common… …   Wikipedia

  • Perron–Frobenius theorem — In linear algebra, the Perron–Frobenius theorem, proved by Oskar Perron (1907) and Georg Frobenius (1912), asserts that a real square matrix with positive entries has a unique largest real eigenvalue and that the corresponding… …   Wikipedia

  • Задача о независимом наборе — Задача о независимом множестве относится к классу NP полных задач в области теории графов. По сути, она полностью эквивалентна задаче о клике. Независимый набор из 9 голубых вершин Множество вершин графа называется независимым, если никакие две… …   Википедия

  • Максимальное независимое множество вершин в дереве — Задача о независимом множестве относится к классу NP полных задач в области теории графов. По сути, она полностью эквивалентна задаче о клике. Независимый набор из 9 голубых вершин Множество вершин графа называется независимым, если никакие две… …   Википедия

  • Covering graph — In the mathematical discipline of graph theory, a graph C is a covering graph of another graph G if there is a covering map from the vertex set of C to the vertex set of G. A covering map f is a surjection and a local isomorphism: the… …   Wikipedia

  • Independent set — The (unexpectedly asymmetric) set of 9 blue vertices is a maximal independent set for this graph of 24 vertices.In graph theory, an independent set or stable set is a set of vertices in a graph no two of which are adjacent. That is, it is a set V …   Wikipedia

  • Tutte polynomial — This article is about the Tutte polynomial of a graph. For the Tutte polynomial of a matroid, see Matroid. The polynomial x4 + x3 + x2y is the Tutte polynomial of the Bull graph. The red line shows the intersection with the plane …   Wikipedia

  • Matrix (mathematics) — Specific elements of a matrix are often denoted by a variable with two subscripts. For instance, a2,1 represents the element at the second row and first column of a matrix A. In mathematics, a matrix (plural matrices, or less commonly matrixes)… …   Wikipedia

  • Independent set (graph theory) — The nine blue vertices form a maximum independent set for the Generalized Petersen graph GP(12,4). In graph theory, an independent set or stable set is a set of vertices in a graph, no two of which are adjacent. That is, it is a set I of vertices …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”