3 papers
math.CO2024
On the -polynomial property of the full bipartite graph of a Hamming graph
Blas Fernández, Roghayeh Maleki, Štefko Miklavič +1
The -polynomial property is an algebraic property of distance-regular graphs, that was introduced by Delsarte in his study of coding theory. Many distance-regular graphs admit t…
math.CO2023
Distance-regular graphs with classical parameters that support a uniform structure: case
Blas Fernández, Roghayeh Maleki, Štefko Miklavič +1
Let denote a finite, simple, connected, and undirected non-bipartite graph with vertex set and edge set . Fix a vertex , and define $\…
math.CO2023
Characterizing bipartite distance-regularized graphs with vertices of eccentricity 4
Blas Fernández, Marija Maksimović, Sanja Rukavina
The characterization of bipartite distance-regularized graphs, where some vertices have eccentricity less than four, in terms of the incidence structures of which they are incidenc…