4 citations · 4 across the 3 of their papers we have counts for
5 papers
On the -polynomial property of bipartite graphs admitting a uniform structure
Blas Fernández, Roghayeh Maleki, Štefko Miklavič +1
Let denote a finite, connected graph with vertex set . Fix and let denote the eccentricity of . For mutually distinct scalars $\{θ^*_i\}_{i=…
On 3-isoregularity of multicirculants
Klavdija Kutnar, Dragan Marušič, Štefko Miklavič
A graph is said to be -{\em isoregular} if any two vertex subsets of cardinality at most , that induce subgraphs of the same isomorphism type, have the same number of neighbo…
On distance magic circulants of valency 6
Štefko Miklavič, Primož Šparl
A graph of order is {\em distance magic} if it admits a bijective labeling of its vertices for which there exists a positive i…
On certain regular nicely distance-balanced graphs
Blas Fernandez, Štefko Miklavič, Safet Penjić
A connected graph $\G$ is called {\em nicely distance--balanced}, whenever there exists a positive integer $γ=γ(\G)$, such that for any two adjacent vertices of $\G$ there ar…
Distance-unbalancedness of graphs
Štefko Miklavič, Primož Šparl
In this paper we propose and study a new structural invariant for graphs, called distance-unbalanced\-ness, as a measure of how much a graph is (un)balanced in terms of distances.…