6 citations · 12 across the 6 of their papers we have counts for
5 papers · 1 filter
Quantum isomorphic strongly regular graphs from the root system
Simon Schmidt
In this article, we give a first example of a pair of quantum isomorphic, non-isomorphic strongly regular graphs, that is, non-isomorphic strongly regular graphs having the same ho…
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…
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…
Twins and Vertex- Identification on Graphs
Sylvain Gravier, Simon Schmidt, Souad Slimani
Recently, several vertex identifying notions were introduced (identifying coloring, lid-coloring, ...), these notions were inspired by identifying codes. All of them, as well as or…
The 3/5-conjecture for weakly -free forests
Simon Schmidt
The -conjecture for the domination game states that the game domination numbers of an isolate-free graph on vertices are bounded as follows: a…