On the uniform structure of bipartite graphs admitting a dual adjacency matrix candidate
Journal of Algebraic Combinatorics · 2026-06 · 63 (4)
DOI: 10.1007/s10801-026-01546-3 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Algebraic Combinatorics, online erschienen am 05.06.2026. Verfasst von Blas Fernández und 3 weiteren Autor:innen. Die Arbeit nennt 9 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Slovenian Research and Innovation Agency.
Abstract (Originalsprache)
Let $$\Gamma $$ Γ denote a finite, bipartite, connected graph with vertex set X . Fix $$x \in X$$ x ∈ X and let $$\varepsilon \ge 3$$ ε ≥ 3 denote the eccentricity of x . For mutually distinct scalars $$\{\theta ^*_i\}_{i=0}^\varepsilon $$ { θ i ∗ } i = 0 ε define a diagonal matrix $$A^*=A^*(\theta ^*_0, \theta ^*_1, \ldots , \theta ^*_{\varepsilon }) \in {{\,\textrm{Mat}\,}}_X(\mathbb {R})$$ A ∗ = A ∗ ( θ 0 ∗ , θ 1 ∗ , … , θ ε ∗ ) ∈ Mat X ( R ) as follows: for $$y \in X$$ y ∈ X set $$(A^*)_{yy} = \theta ^*_{\partial (x,y)}$$ ( A ∗ ) yy = θ ∂ ( x , y ) ∗ , where $$\partial $$ ∂ denotes the shortest path-length distance function of $$\Gamma $$ Γ . We say that $$A^*$$ A ∗ is a dual adjacency matrix candidate of $$\Gamma $$ Γ with respect to x if the adjacency matrix $$A \in {{\,\textrm{Mat}\,}}_X(\mathbb {R})$$ A ∈ Mat X ( R ) of $$\Gamma $$ Γ and $$A^*$$ A ∗ satisfy $$ A^3 A^* - A^* A^3+(\beta +1)( A A^* A^2 - A^2 A^* A)= \rho ( A A^* - A^* A) $$ A 3 A ∗ - A ∗ A 3 + ( β + 1 ) ( A A ∗ A 2 - A 2 A ∗ A ) = ρ ( A A ∗ - A ∗ A ) for some scalars $$\beta , \rho \in \mathbb {R}$$ β , ρ ∈ R . In this paper, we investigate when bipartite graphs that admit a dual adjacency matrix candidate also admit a uniform structure (in the sense of Terwilliger [6]). To do that, we first define a weakly uniform structure by slightly relaxing the conditions of uniform structure. The main result of this paper is that $$\Gamma $$ Γ admits a dual adjacency matrix candidate with respect to x if and only if $$\Gamma $$ Γ admits a weakly uniform structure with respect to x whose parameters satisfy some additional conditions. In particular, for $$\beta =2$$ β = 2 , the weakly uniform structure is indeed a uniform structure.
Förderung
- Slovenian Research and Innovation Agency
Zitieren
APA
Fernández, B., Maleki, R., Miklavič, Š., & Monzillo, G. (2026). On the uniform structure of bipartite graphs admitting a dual adjacency matrix candidate. Journal of Algebraic Combinatorics, 63(4). https://doi.org/10.1007/s10801-026-01546-3
Vancouver
Fernández B, Maleki R, Miklavič Š, Monzillo G. On the uniform structure of bipartite graphs admitting a dual adjacency matrix candidate. Journal of Algebraic Combinatorics. 2026;63(4). doi:10.1007/s10801-026-01546-3
BibTeX
@article{Fernndez2026,
author = {Fernández, Blas and Maleki, Roghayeh and Miklavič, Štefko and Monzillo, Giusy},
title = {On the uniform structure of bipartite graphs admitting a dual adjacency matrix candidate},
journal = {Journal of Algebraic Combinatorics},
year = {2026},
volume = {63},
number = {4},
doi = {10.1007/s10801-026-01546-3}
}
EUVIMED