4 citations · 10 across the 11 of their papers we have counts for
14 papers
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…
The Grünbaum--Rigby configuration as a special Kárteszi configuration
Gábor Gévay, György Kiss, Tomaž Pisanski
In 1990, Branko Grünbaum and John Rigby presented a 4-configuration, known today as the \emph{Grünbaum--Rigby configuration}; it is denoted by . Independently an…
The Möbius-Kantor graph is a faithful unit-distance graph
Nino Bašić, Gábor Gévay, Tomaž Pisanski
In this paper, it has been shown that the generalized Petersen graph , also known as the Möbius-Kantor graph, admits a faithful unit-distance representation in t…
Polycyclic Geometric Realizations of the Gray Configuration
Leah Wrenn Berman, Gábor Gévay, Tomaž Pisanski
The Gray configuration is a (27_3) configuration which typically is realized as the points and lines of the 3 x 3 x 3 integer lattice. It occurs as a member of an infinite family o…
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…
On singular signed graphs with nullspace spanned by a full vector: Signed nut graphs
Nino Bašić, Patrick W. Fowler, Tomaž Pisanski +1
A signed graph has edge weights drawn from the set , and is termed sign-balanced if it is equivalent to an unsigned graph under the operation of sign switching; otherwis…
Regular Antilattices
Karin Cvetko-Vah, Michael Kinyon, Jonathan Leech +1
Antilattices for which the Green's equivalences , , and are all congruence…
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…
Point-ellipse and some other exotic configurations
Gábor Gévay, Nino Bašić, Jurij Kovič +1
In this paper we introduce point-ellipse configurations and point-conic configurations. We study some of their basic properties and describe two interesting families of balanced po…
Characterization of generalized Petersen graphs that are Kronecker covers
Matjaž Krnc, Tomaž Pisanski
The family of generalized Petersen graphs , introduced by Coxeter et al. [4] and named by Mark Watkins (1969), is a family of cubic graphs formed by connecting the vertice…
Vertex-transitive Haar graphs that are not Cayley graphs
Marston Conder, István Estélyi, Tomaž Pisanski
In a recent paper (arXiv:1505.01475 ) Estélyi and Pisanski raised a question whether there exist vertex-transitive Haar graphs that are not Cayley graphs. In this note we construct…
Iterated altans and their properties
Nino Bašić, Tomaž Pisanski
Recently a class of molecular graphs, called altans, became a focus of attention of several theoretical chemists and mathematicians. In this paper we study primary iterated altans…
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…
On the Number of Hamiltonian Groups
Boris Horvat, Gašper Jaklič, Tomaž Pisanski
Finite hamiltonian groups are counted. The sequence of numbers of all groups of order all whose subgroups are normal and the sequence of numbers of all groups of order less or…