Mark S. MacLean

most citedThe Terwilliger algebra of an almost-bipartite P- and Q-polynomial association scheme

1 citations · 2 across the 2 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2005★ 1 cited

The Terwilliger algebra of an almost-bipartite P- and Q-polynomial association scheme

John S. Caughman, Mark S. MacLean, Paul M. Terwilliger

Let $Y$ denote a $D$ -class symmetric association scheme with $D \geq 3$ , and suppose $Y$ is almost-bipartite P- and Q-polynomial. Let $x$ denote a vertex of $Y$ and let $T = T (x)$ de…

math.CO2005★ 1 cited

Taut distance-regular graphs and the subconstituent algebra

Mark S. MacLean, Paul Terwilliger

We consider a bipartite distance-regular graph $G$ with diameter $D$ at least 4 and valency $k$ at least 3. We obtain upper and lower bounds for the local eigenvalues of $G$ in ter…