6 citations · 6 across the 3 of their papers we have counts for
5 papers · 1 filter
On Cyclic Edge-Connectivity of Fullerenes
Klavdija Kutnar, Dragan Marusic
A graph is said to be cyclic -edge-connected, if at least edges must be removed to disconnect it into two components, each containing a cycle. Such a set of edges is cal…
Hamilton Paths and Cycles in Vertex-Transitive Graphs of Order
Klavdija Kutnar, Primoz Sparl
It is shown that every connected vertex-transitive graph of order , where is a prime, contains a Hamilton path. Moreover, it is shown that, except for the truncation of the…
On 2-Fold Covers of Graphs
Yan-Quan Feng, Klavdija Kutnar, Aleksander Malnic +1
A regular covering projection $\p\colon \tX \to X$ of connected graphs is -admissible if lifts along $\p$. Denote by $\tG$ the lifted group, and let $\CT(\p)$ be the group o…
Hamiltonicity of Vertex-Transitive Graphs of Order
Klavdija Kutnar, Dragan Marusic
It is shown that every connected vertex-transitive graph of order , where is a prime, is hamiltonian with the exception of the Coxeter graph which is known to possess a Ham…
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…