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 theorem has particular use in algebraic graph theory. The "underlying graph" of a nonnegative n-square matrix is the graph with vertices numbered 1, ..., n and arc ij if and only if A ij ≠ 0. If the underlying graph of such a matrix is strongly connected, then the matrix is irreducible, and thus the theorem applies. In particular, the ...
A graph with 6 vertices and 7 edges. In mathematics and computer science, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.
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.
In graph theory, a strongly regular graph (SRG) is a regular graph G = (V, E) with v vertices and degree k such that for some given integers , every two adjacent vertices have λ common neighbours, and; every two non-adjacent vertices have μ common neighbours.
This notion has made it possible to use the methods of graph theory in universal algebra and several other areas of discrete mathematics and computer science.Graph algebras have been used, for example, in constructions concerning dualities, [2] equational theories, [3] flatness, [4] groupoid rings, [5] topologies, [6] varieties, [7] finite-state machines, [8] [9] tree languages and tree ...