enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Chris Godsil - Wikipedia

    en.wikipedia.org/wiki/Chris_Godsil

    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.

  3. Algebraic graph theory - Wikipedia

    en.wikipedia.org/wiki/Algebraic_graph_theory

    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 .

  4. Algebraic combinatorics - Wikipedia

    en.wikipedia.org/wiki/Algebraic_combinatorics

    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.

  5. List of graph theory topics - Wikipedia

    en.wikipedia.org/wiki/List_of_graph_theory_topics

    Bivariegated graph; Cage (graph theory) Cayley graph; Circle graph; Clique graph; Cograph; Common graph; Complement of a graph; Complete graph; Cubic graph; Cycle graph; De Bruijn graph; Dense graph; Dipole graph; Directed acyclic graph; Directed graph; Distance regular graph; Distance-transitive graph; Edge-transitive graph; Interval graph ...

  6. Strongly regular graph - Wikipedia

    en.wikipedia.org/wiki/Strongly_regular_graph

    The smallest Paley graph, with q = 5, is the 5-cycle (above). Self-complementary arc-transitive graphs are strongly regular. A strongly regular graph is called primitive if both the graph and its complement are connected. All the above graphs are primitive, as otherwise μ = 0 or λ = k.

  7. Category:Algebraic graph theory - Wikipedia

    en.wikipedia.org/.../Category:Algebraic_graph_theory

    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 ...

  8. Norman L. Biggs - Wikipedia

    en.wikipedia.org/wiki/Norman_L._Biggs

    In 1974, Biggs published Algebraic Graph Theory which articulates properties of graphs in algebraic terms, then works out theorems regarding them. In the first section, he tackles the applications of linear algebra and matrix theory; algebraic constructions such as adjacency matrix and the incidence matrix and their applications are discussed ...

  9. Adjacency algebra - Wikipedia

    en.wikipedia.org/wiki/Adjacency_algebra

    In algebraic graph theory, the adjacency algebra of a graph G is the algebra of polynomials in the adjacency matrix A(G) of the graph. It is an example of a matrix algebra and is the set of the linear combinations of powers of A. [1] Some other similar mathematical objects are also called "adjacency algebra".