Dual Bipartite $Q$-Polynomial Distance-Regular Graphs and Dual Uniform Structures

Let $\Gamma$ denote a dual bipartite $Q$-polynomial distance-regular graph with vertex set $X$ and diameter $D \geq 3$. Fix $x \in X$, and let $L^*$ and $R^*$ denote the corresponding dual lowering and dual raising matrix, respectively. We show that a certain linear dependency among $R^* L^{* 2}, L^* R^* L^*, L^{* 2} R^*, L^*$ holds, and determine whether this linear dependency endow $\Gamma$ with a dual uniform or dual strongly uniform structure. Precisely, except for two special cases a dual uniform structure is always attained, and except for four special cases a dual strongly uniform structure is always attained.

Authors

Institutions

Publication Details

Journal
The Electronic Journal of Combinatorics
Published
2024-10-31
DOI
https://doi.org/10.37236/13054
Primary Topic
Advanced Topics in Algebra
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dual Bipartite $Q$-Polynomial Distance-Regular Graphs and Dual Uniform Structures

Giusy Monzillo
The Electronic Journal of Combinatorics
Advanced Topics in Algebra
article

Dual Bipartite $Q$-Polynomial Distance-Regular Graphs and Dual Uniform Structures

Giusy Monzillo
article en

Abstract

Let $\Gamma$ denote a dual bipartite $Q$-polynomial distance-regular graph with vertex set $X$ and diameter $D \geq 3$. Fix $x \in X$, and let $L^*$ and $R^*$ denote the corresponding dual lowering and dual raising matrix, respectively. We show that a certain linear dependency among $R^* L^{* 2}, L^* R^* L^*, L^{* 2} R^*, L^*$ holds, and determine whether this linear dependency endow $\Gamma$ with a dual uniform or dual strongly uniform structure. Precisely, except for two special cases a dual uniform structure is always attained, and except for four special cases a dual strongly uniform structure is always attained.

The Electronic Journal of CombinatoricsVol. 31(4)
University of Primorska (SI)
Openalex Percentile: Top 65%
Advanced Topics in Algebra
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.