6 citations · 12 across the 6 of their papers we have counts for
4 papers · 1 filter
Uniformly vertex-transitive graphs
Simon Schmidt, Chase Vogeli, Moritz Weber
We introduce uniformly vertex-transitive graphs as vertex-transitive graphs satisfying a stronger condition on their automorphism groups, motivated by a problem which arises from a…
Sinkhorn algorithm for quantum permutation groups
Ion Nechita, Simon Schmidt, Moritz Weber
We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogona…
Existence of quantum symmetries for graphs on up to seven vertices: a computer based approach
Christian Eder, Viktor Levandovskyy, Julien Schanz +3
The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined b…
On the quantum symmetry of distance-transitive graphs
Simon Schmidt
In this article, we study quantum automorphism groups of distance-transitive graphs. We show that the odd graphs, the Hamming graphs , the Johnson graphs and the K…