Štefko Miklavič

collaborators

3 papers

math.CO2023

Distance-regular graphs with classical parameters that support a uniform structure: case $q \geq 2$

Blas Fernández, Roghayeh Maleki, Štefko Miklavič +1

Let $Γ = (X, R)$ denote a finite, simple, connected, and undirected non-bipartite graph with vertex set $X$ and edge set $R$ . Fix a vertex $x \in X$ , and define $\…

math.CO2023

Distance-regular graphs with classical parameters that support a uniform structure: case $q \leq 1$

Blas Fernández, Roghayeh Maleki, Štefko Miklavič +1

Let $Γ = (X, R)$ denote a finite, simple, connected, and undirected non-bipartite graph with vertex set $X$ and edge set $R$ . Fix a vertex $x \in X$ , and define $\…

math.CO2016

On bipartite distance-regular graphs with exactly two irreducible T-modules with endpoint 2

Mark S. MacLean, Stefko Miklavic

Let $Γ$ denote a bipartite distance-regular graph with diameter $D \geq 4$ and valency $k \geq 3$ . Let $X$ denote the vertex set of $Γ$ , and let $A$ denote the adjacency matrix of $Γ…

Distance-regular graphs with classical parameters that support a uniform structure: case q≥2

Distance-regular graphs with classical parameters that support a uniform structure: case q≤1

On bipartite distance-regular graphs with exactly two irreducible T-modules with endpoint 2

Distance-regular graphs with classical parameters that support a uniform structure: case $q \geq 2$

Distance-regular graphs with classical parameters that support a uniform structure: case $q \leq 1$