4 citations · 16 across the 16 of their papers we have counts for
Showing 2005Show all
3 papers · 1 filter
math.CO2005★ 4 cited
Semisymmetric elementary abelian covers of the Möbius-Kantor graph
A. Malnic, D. Marusic, S. Miklavic +1
Let $\p_N \colon \tX \to X$ be a regular covering projection of connected graphs with the group of covering transformations isomorphic to . If is an elementary abelian -g…
math.CO2005
Distance-balanced graphs: symmetry conditions
K. Kutnar, A. Malnic, D. Marusic +1
A graph is said to be {\it distance--balanced} if for any edge of , the number of vertices closer to than to is equal to the number of vertices closer to th…
math.CO2005
Hamiltonicity of Cubic Cayley Graphs
Henry Glover, Dragan Marusic
Following a problem posed by Lovász in 1969, it is believed that every connected vertex-transitive graph has a Hamilton path. This is shown here to be true for cubic Cayley graphs…