Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2503.02339 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- Let $Γ$ denote a finite, connected graph with vertex set $X$. Fix $x \in X$ and let $\varepsilon \ge 3$ denote the eccentricity of $x$. For mutually distinct scalars $\{θ^*_i\}_{i=0}^\varepsilon$ define a diagonal matrix $A^*=A^*(θ^*_0, θ^*_1, \ldots, θ^*_{\varepsilon}) \in M_X(\mathbb{R})$ as follows: for $y \in X$ we let $(A^*)_{yy} = θ^*_{\partial(x,y)}$, where $\partial$ denotes the shortest path length distance function of $Γ$. We say that $A^*$ is a dual adjacency matrix candidate of $Γ$ with respect to $x$ if the adjacency matrix $A \in M_X(\mathbb{R})$ of $Γ$ and $A^*$ satisfy $$ A^3 A^* - A^* A^3+(β+1)( A A^* A^2 - A^2 A^* A)= γ(A^2A^*-A^*A^2)+ρ( A A^* - A^* A) $$ for some scalars $β, γ, ρ\in \mathbb{R}$. Assume now that $Γ$ is uniform with respect to $x$ in the sense of Terwilliger [Coding theory and design theory, Part I, IMA Vol. Math. Appl., 20, 193-212 (1990)]. In this paper, we give sufficient conditions on the uniform structure of $Γ$, such that $Γ$ admits a dual adjacency matrix candidate with respect to $x$. As an application of our results, we show that the full bipartite graphs of dual polar graphs are $Q$-polynomial.