The subconstituent algebra of a strongly regular graph

DOI10.1007/s10801-005-2504-4zbMath1069.05081OpenAlexW2069965951MaRDI QIDQ2388446

Hiroshi Suzuki

Publication date: 14 September 2005

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10801-005-2504-4

zbMATH Keywords

Terwilliger algebradistance-regular graphassociation schemecompletely regular codetight graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (16)

Distance-regular graphs of large diameter that are completely regular clique graphs ⋮ Tight distance-regular graphs with respect to subsets ⋮ On strongly closed subgraphs with diameter two and the \(Q\)-polynomial property ⋮ Grassmann graphs, degenerate DAHA, and non-symmetric dual \(q\)-Hahn polynomials ⋮ On bipartite distance-regular graphs with a strongly closed subgraph of diameter three ⋮ An algebra associated with a subspace lattice over a finite field and its relation to the quantum affine algebra \(U_q(\hat{\mathfrak{sl}}_2)\) ⋮ Completely regular clique graphs ⋮ \(Q\)-polynomial distance-regular graphs and a double affine Hecke algebra of rank one ⋮ Nonsymmetric Askey-Wilson polynomials and \(Q\)-polynomial distance-regular graphs ⋮ Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs ⋮ Dual polar graphs, a nil-DAHA of rank one, and non-symmetric dual \(q\)-Krawtchouk polynomials ⋮ Dual polar graphs, a nil-DAHA of rank one, and non-symmetric dual \(q\)-Krawtchouk polynomials ⋮ Almost 2-homogeneous graphs and completely regular quadrangles ⋮ Commutative association schemes ⋮ Parallelogram-free distance-regular graphs having completely regular strongly regular subgraphs ⋮ Completely regular clique graphs. II

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The girth of a thin distance-regular graph
• The irreducible modules of the Terwilliger algebras of Doob schemes
• The subconstituent algebra of an association scheme. I
• The subconstituent algebra of an association scheme. III
• The subconstituent algebra of an association scheme. II
• The Terwilliger algebra of the hypercube
• A new feasibility condition for distance-regular graphs
• Completely regular codes
• Spectra of bipartite \(P\)- and \(Q\)-polynomial association schemes
• Distance-regular graphs which support a spin model are thin
• Tight graphs and their primitive idempotents
• The Terwilliger algebras of bipartite \(P\)- and \(Q\)-polynomial schemes
• Bipartite distance-regular graphs. I
• Problems in algebraic combinatorics
• Krein parameters and antipodal tight graphs with diameter 3 and 4
• A note on thin \(P\)-polynomial and dual-thin \(Q\)-polynomial symmetric association schemes
• The structure of nonthin irreducible \(T\)-modules of endpoint 1: Ladder bases and classical parameters
• 1-homogeneous graphs with cocktail party \({\mu}\)-graphs
• The Terwilliger algebra of an almost-bipartite distance-regular graph and its antipodal 2-cover
• 2-homogeneous bipartite distance-regular graphs
• Almost 2-homogeneous bipartite distance-regular graphs
• Nonexistence of some antipodal distance-regular graphs of diameter four
• An inequality involving two eigenvalues of a bipartite distance-regular graph
• Tight distance-regular graphs
• The generalized Terwilliger algebra and its finite-dimensional modules when \(d=2\)
• Completely transitive codes in Hamming graphs
• An inequality involving the local eigenvalues of a distance-regular graph
• The subconstituent algebra of a distance-regular graph; thin modules with endpoint one
• Tight distance-regular graphs and the subconstituent algebra
• An inequality in character algebras
• Taut distance-regular graphs of odd diameter
• Twice Q-polynomial distance-regular graphs are thin
• Bipartite distance-regular graphs. II
• The local structure of a bipartite distance-regular graph
• An Algebraic Characterization of Completely Regular Codes in Distance-Regular Graphs
• Completely regular designs
• The Subconstituent Algebra of a Strongly Regular Graph
• A generalization of the Terwilliger algebra
• Distance-regular graphs related to the quantum enveloping algebra of \(sl(2)\)
• A local approach to 1-homogeneous graphs
• An inequality on the cosines of a tight distance-regular graph
• Tight distance-regular graphs and the \(Q\)-polynomial property
• On the algebraic theory of pseudo-distance-regularity around a set

This page was built for publication: The subconstituent algebra of a strongly regular graph