1. On the uniform structure of bipartite graphs admitting a dual adjacency matrix candidateBlas Fernández, Roghayeh Maleki, Štefko Miklavič, Giusy Monzillo, 2026, izvirni znanstveni članek Opis: Let Γ denote a finite, bipartite, connected graph with vertex set X. Fix x ∈ X and let ε ≥ 3 denote the eccentricity of x. For mutually distinct scalars {θ ∗ i }ε i=0 define a diagonal matrix A∗ = A∗(θ ∗ 0 , θ ∗ 1 , . . . , θ ∗ ε ) ∈ Mat X (R) as follows: for y ∈ X set (A∗)yy = θ ∗ ∂(x,y), where ∂ 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 ∈ Mat X (R) of Γ and A∗ satisfy A3 A∗ − A∗ A3 + (β + 1)(A A∗ A2 − A2 A∗ A) = ρ(A A∗ − A∗ A) for some scalars β, ρ ∈ 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 Γ admits a dual adjacency matrix candidate with respect to x if and only if Γ admits a weakly uniform structure with respect to x whose parameters satisfy some additional conditions. In particular, for β = 2, the weakly uniform structure is indeed a uniform structure.
Ključne besede: uniform property, dual adjacency matrix, Q-polynomial property
Objavljeno v RUP: 18.06.2026; Ogledov: 587; Prenosov: 10
 Celotno besedilo (318,25 KB)
Gradivo ima več datotek! Več... |
2. Uniform equations for bipartite graphs and the center of a Terwilliger algebraŠtefko Miklavič, Giusy Monzillo, 2026, izvirni znanstveni članek Opis: The uniform property was introduced by P. Terwilliger in the context of graded posets and was later extended to connected bipartite graphs. The core of this definition involves the so called uniform equations that must be satisfied. Let Γ denote a connected bipartite graph. Fix a vertex x of Γand let T=T(x) denote the corresponding Terwilliger algebra. In this paper, we study the connections between the uniform equations and the center of T. We show that these uniform equations give rise to a certain subspace of the center of T. Changing the logical direction, we show that if a matrix of a particular form belongs to the center of T, then uniform equations are satisfified.
Ključne besede: uniform equations, center of a Terwilliger algebra, bipartite graphs
Objavljeno v RUP: 08.05.2026; Ogledov: 592; Prenosov: 19
Celotno besedilo (966,73 KB)
Gradivo ima več datotek! Več... |
3. |
4. On commutative association schemes and associated (directed) graphsGiusy Monzillo, Safet Penjić, 2025, izvirni znanstveni članek Opis: Let ${\mathcal M}$ denote the Bose--Mesner algebra of a commutative $d$-class association scheme ${\mathfrak X}$ (not necessarily symmetric), and $\Gamma$ denote a (strongly) connected (directed) graph with adjacency matrix $A$. Under the assumption that $A$ belongs to ${\mathcal M}$, we describe the combinatorial structure of $\Gamma$. Moreover, we provide an algebraic-combinatorial characterization of $\Gamma$ when $A$ generates ${\mathcal M}$. Among else, we show that, if ${\mathfrak X}$ is a commutative $3$-class association scheme that is not an amorphic symmetric scheme, then we can always find a (directed) graph $\Gamma$ such that the adjacency matrix $A$ of $\Gamma$ generates the Bose--Mesner algebra ${\mathcal M}$ of ${\mathfrak X}$.
Ključne besede: commutative association schemes, association schemes, Bose-Mesner algebra, equitable partition, graphs generating schemes, quotient-polynomial graphs, x-distance-faithful intersection diagram
Objavljeno v RUP: 26.09.2025; Ogledov: 1086; Prenosov: 7
Celotno besedilo (483,56 KB)
Gradivo ima več datotek! Več... |
