Search results
Results from the WOW.Com Content Network
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.
Algebraic graph theory is a branch of mathematics in which algebraic methods are applied to problems about graphs. This is in contrast to geometric , combinatoric , or algorithmic approaches. There are three main branches of algebraic graph theory, involving the use of linear algebra , the use of group theory , and the study of graph invariants .
Gordon F. Royle is a professor at the School of Mathematics and Statistics at The University of Western Australia. [1]Royle is the co-author (with Chris Godsil) of the book Algebraic Graph Theory (Springer Verlag, 2001, ISBN 0-387-95220-9).
The Fano matroid, derived from the Fano plane.Matroids are one of many kinds of objects studied in algebraic combinatorics. Algebraic combinatorics is an area of mathematics that employs methods of abstract algebra, notably group theory and representation theory, in various combinatorial contexts and, conversely, applies combinatorial techniques to problems in algebra.
Algebraic graph theory is a branch of graph theory Subcategories. This category has the following 2 subcategories, out of 2 total. C. Cayley graphs (3 P) R. Regular ...
Graduate Texts in Mathematics (GTM) (ISSN 0072-5285) is a series of graduate-level textbooks in mathematics published by Springer-Verlag.The books in this series, like the other Springer-Verlag mathematics series, are yellow books of a standard size (with variable numbers of pages).
In graph theory and computer science, an adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate whether pairs of vertices are adjacent or not in the graph. In the special case of a finite simple graph, the adjacency matrix is a (0,1)-matrix with zeros on its diagonal.
Miroslav Fiedler (7 April 1926 – 20 November 2015) was a Czech mathematician known for his contributions to linear algebra, graph theory and algebraic graph theory.. His article, "Algebraic Connectivity of Graphs", published in the Czechoslovak Math Journal in 1973, established the use of the eigenvalues of the Laplacian matrix of a graph to create tools for measuring algebraic connectivity ...