9 citations · 22 across the 22 of their papers we have counts for
24 papers
Group distance magic cubic graphs
Sylwia Cichacz, Štefko Miklavič
A \emph{-distance magic labeling} of a graph with is a bijection from to an Abelian group of order , for which there exists , su…
A classification of -polynomial distance-regular graphs with girth
Štefko Miklavič
Let denote a -polynomial distance-regular graph with diameter and valency . In [Homotopy in -polynomial distance-regular graphs, Discrete Math., {\bf 223} (2…
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…
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 $\…
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 $\…
On closed distance magic circulants of valency up to
Blas Fernández, Roghayeh Maleki, Štefko Miklavič +1
Let be a graph of order . A {\em closed distance magic labeling} of is a bijection for which there exists a positive integer …