On $Q$-Polynomial Association Schemes of Small Class
Copyright policy )On $Q$-Polynomial Association Schemes of Small Class
We show an inequality involving the third largest or second smallest dual eigenvalues of $Q$-polynomial association schemes of class at least three. Also we characterize dual-tight $Q$-polynomial association schemes of class three. Our method is based on tridiagonal matrices and can be applied to distance-regular graphs as well.
- Tohoku University Japan
Q-polynomial association scheme, Distance in graphs, distance-regular graph, FOS: Mathematics, Association schemes, strongly regular graphs, Mathematics - Combinatorics, Combinatorics (math.CO), Other designs, configurations
Q-polynomial association scheme, Distance in graphs, distance-regular graph, FOS: Mathematics, Association schemes, strongly regular graphs, Mathematics - Combinatorics, Combinatorics (math.CO), Other designs, configurations
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!