Terwilliger algebras and some related algebras defined by finite connected simple graphs
From MaRDI portal
Publication:6098091
Abstract: For a finite connected simple graph, the Terwilliger algebra is a matrix algebra generated by the adjacency matrix and idempotents corresponding to the distance partition with respect to a fixed vertex. We will consider algebras defined by two other partitions and the centralizer algebra of the stabilizer of the fixed vertex in the automorphism group of the graph. We will give some methods to compute such algebras and examples for various graphs.
Recommendations
Cites work
- scientific article; zbMATH DE number 4101445 (Why is no real title available?)
- Irreducible representations of the Terwilliger algebra of a tree
- Paley and the Paley Graphs
- Spectra of graphs
- Strongly regular graphs having strongly regular subconstituents
- The Subconstituent Algebra of a Strongly Regular Graph
- The isomorphism problem of trees from the viewpoint of Terwilliger algebras
- The quantum adjacency algebra and subconstituent algebra of a graph
- The subconstituent algebra of an association scheme. I
- The subconstituent algebra of an association scheme. II
- The subconstituent algebra of an association scheme. III
Cited in
(7)- scientific article; zbMATH DE number 7646798 (Why is no real title available?)
- Terwilliger algebras and the Weisfeiler-Leman stabilization
- Terwilliger algebra for a family of folded cube graphs
- A survey of semisimple algebras in algebraic combinatorics
- Irreducible representations of the Terwilliger algebra of a tree
- The Terwilliger algebra of Odd graphs
- The Terwilliger algebras of Johnson graphs
This page was built for publication: Terwilliger algebras and some related algebras defined by finite connected simple graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6098091)