5 problems

Let $C_n(A)$ and $C_n(B)$ be circulant graphs, where $A$ and $B$ are inverse-closed subsets of $\mathbb Z_n\setminus\{0\}$. For a unit $t\in U(n)$, multiplication by $t$ gives an i…

Let $G:X\to X$ and $H:A\to A$ be irreflexive quantum graphs. The quantum graph isomorphism game is … with … A quantum graph isomorphism from $G$ to $H$ is the corresponding structu…

Let $q_1,q_2\boxtimes$ be quadratic forms on $\operatorname{\mathbb{Q}}^n$, and let $G_0(\operatorname{\mathbb{Q}}^n,q)$ denote the connected component containing…

Let $G$ and $H$ be non-abelian finite groups, and suppose their non-commuting graphs are isomorphic. Abdollahi et al.'s order conjecture. Then … This conjecture concerns whether th…

A $2$-step circulant graph is a circulant graph whose connection set has two steps; for a positive integer $m$ and a connection set $A\subseteq \mathbb{Z}/m\mathbb{Z}$, denote it b…