6 papers
On the Hamiltonian Bicirculants
S. Bonvicini, T. Pisanski, A. Žitnik
A bicirculant is a regular graph that admits a semi-regular automorphism with two vertex-orbits of the same size. By we denote the size of vertex-orbits and by the valence…
All generalized rose window graphs are hamiltonian
Simona Bonvicini, Tomaž Pisanski, Arjana Žitnik
A bicirculant is a regular, -valent graph that admits a semiregular automorphism of order having two vertex-orbits of size . The vertices of each orbit induce a circulant…
The Gray graph is a unit-distance graph
Leah Wrenn Berman, Gábor Gévay, Tomaz Pisanski
In this note we give a construction proving that the Gray graph, which is the smallest cubic semi-symmetric graph, is a unit-distance graph.
Classification of cubic tricirculant nut graphs
Ivan Damnjanović, Nino Bašić, Tomaž Pisanski +1
A nut graph is a simple graph whose adjacency matrix has the eigenvalue zero with multiplicity one such that its corresponding eigenvector has no zero entries. It is known that the…
Solving the Mostar index inverse problem
Yaser Alizadeh, Nino Bašić, Ivan Damnjanović +4
A nonnegative integer is realizable by a graph-theoretical invariant if there exist a graph such that . The inverse problem for consists of finding all no…
On a new (21_4) polycyclic configuration
Leah Wrenn Berman, Gábor Gévay, Tomaz Pisanski
When searching for small 4-configurations of points and lines, polycyclic configurations, in which every symmetry class of points and lines contains the same number of elements, ha…