On central elements in the Terwilliger algebra of hamming graph
Let n and D be positive integers with n 3, and let H(D n) denote the Hamming graph. Recall the graph H(D n) is distance-regular of diameter D. Let X denote the vertex set of H(D n), and let MatX(C) denote the C-algebra of matrices with rows and columns indexed by X. Let A 2 MatX(C) denote the adjace...
Saved in:
Main Author: | Arcilla, Abigail P. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2018
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_doctoral/554 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
On the Terwilliger algebra and quantum adjacency algebra of the Shrikhande graph
by: Morales, John Vincent S., et al.
Published: (2020) -
The terwilliger algebra of a distance-regular graph
by: Go, Junie T.
Published: (1999) -
Algebraic implications of certain combinatorial properties of a graph
by: Amparado, Ralph Gabriel P., et al.
Published: (2010) -
Toxicity prediction via algebraic graph-assisted bidirectional transformers
by: Ooi, Yen Sun
Published: (2023) -
The Terwilliger algebra of the hypercube
by: Go, Junie T.
Published: (2002)