5 citations · 10 across the 9 of their papers we have counts for
11 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…
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…
Circular bidiagonal pairs
Paul Terwilliger, Arjana Žitnik
A square matrix is said to be circular bidiagonal whenever (i) each nonzero entry is on the diagonal, or the subdiagonal, or in the top-right corner; (ii) each subdiagonal entry is…
The quantum adjacency algebra and subconstituent algebra of a graph
Paul Terwilliger, Arjana Žitnik
Let denote a finite, undirected, connected graph, with vertex set . Fix a vertex . Associated with is a certain subalgebra of ,…
Half-arc-transitive graphs of arbitrary even valency greater than 2
Marston D. E. Conder, Arjana Žitnik
A half-arc-transitive graph is a regular graph that is both vertex- and edge-transitive, but is not arc-transitive. If such a graph has finite valency, then its valency is even, an…
Vertex-transitive graphs and their arc-types
Marston Conder, Tomaž Pisanski, Arjana Žitnik
Let be a finite vertex-transitive graph of valency , and let be the full automorphism group of . Then the arc-type of is defined in terms of the sizes of the orbi…
Combinatorial configurations, quasiline arrangements, and systems of curves on surfaces
Jürgen Bokowski, Jurij Kovič, Tomaž Pisanski +1
It is well known that not every combinatorial configuration admits a geometric realization with points and lines. Moreover, some of them do not even admit realizations with pseudol…
Distance-regular graphs of -Racah type and the universal Askey-Wilson algebra
Paul Terwilliger, Arjana Žitnik
Let $\C$ denote the field of complex numbers, and fix a nonzero $q \in \C$ such that . Define a $\C$-algebra by generators and relations in the following way. The…
A note on dilation coefficient, plane-width, and resolution coefficient of graphs
Martin Milanic, Tomaz Pisanski, Arjana Zitnik
In this note we study and compare three graph invariants related to the 'compactness' of graph drawing in the plane: the dilation coefficient, defined as the smallest possible quot…
A characterization of Q-polynomial distance-regular graphs
Aleksandar Jurisic, Paul Terwilliger, Arjana Zitnik
We obtain the following characterization of -polynomial distance-regular graphs. Let $\G$ denote a distance-regular graph with diameter . Let denote a minimal idempo…