Journal
DISCRETE MATHEMATICS
Volume 346, Issue 9, Pages -Publisher
ELSEVIER
DOI: 10.1016/j.disc.2023.113509
Keywords
Centralizer algebra; Finite connected simple graph; Terwilliger algebra
Categories
Ask authors/readers for more resources
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.
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. (c) 2023 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available