3 citations · 3 across the 3 of their papers we have counts for
4 papers
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…
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…