1 citations · 1 across the 3 of their papers we have counts for
4 papers · 1 filter
On the hamiltonicity problem of bicirculants: a reduction to cyclic Haar graphs
Simona Bonvicini, Tomaž Pisanski, Arjana Žitnik
A bicirculant is a regular graph that admits an automorphism having two vertex-orbits of the same size. A bicirculant can be described as follows. Given an integer and se…
Classification of quartic bicirculant nut graphs
Ivan Damnjanović, Nino Bašić, Tomaž Pisanski +1
A graph is called a nut graph if zero is its eigenvalue of multiplicity one and its corresponding eigenvector has no zero entries. A graph is a bicirculant if it admits an automorp…
The Sierpiński product of graphs
Jurij Kovič, Tomaž Pisanski, Sara Sabrina Zemljič +1
In this paper we introduce a product-like operation that generalizes the construction of generalized Sierpiński graphs. Let be graphs and let be a function…
GI-graphs and their groups
Marston D. E. Conder, Tomaž Pisanski, Arjana Žitnik
The class of generalized Petersen graphs was introduced by Coxeter in the 1950s. Frucht, Graver and Watkins determined the automorphism groups of generalized Petersen graphs in 197…