Stability of nontrivial graph pairs

Xiaomeng Wang, Xing Gao

A graph pair $(\Gamma ,\Sigma )$ is called stable if every automorphism of the direct product $\Gamma \times \Sigma$ is induced componentwise by automorphisms of $\Gamma$ and $\Sigma$. A graph is twin-free if no t…