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 .
In mathematics, a graph C*-algebra is a universal C*-algebra constructed from a directed graph. Graph C*-algebras are direct generalizations of the Cuntz algebras and Cuntz-Krieger algebras, but the class of graph C*-algebras has been shown to also include several other widely studied classes of C*-algebras .
The chromatic symmetric function is a symmetric function invariant of graphs studied in algebraic graph theory, a branch of mathematics. It is the weight generating function for proper graph colorings, and was originally introduced by Richard Stanley as a generalization of the chromatic polynomial of a graph. [1]
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 ...
Just as a graph C*-algebra can be associated to a directed graph, a universal C*-algebra can be associated to a -graph. Let Λ {\displaystyle \Lambda } be a row-finite k {\displaystyle k} -graph with no sources then a Cuntz–Krieger Λ {\displaystyle \Lambda } -family or a represenentaion of Λ {\displaystyle \Lambda } in a C*-algebra B is a ...
In the following figure, the graph C is a covering graph of the graph H. The covering map f from C to H is indicated with the colours. For example, both blue vertices of C are mapped to the blue vertex of H. The map f is a surjection: each vertex of H has a preimage in C. Furthermore, f maps bijectively each neighbourhood of a vertex v in C ...
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.