Stability of nontrivial graph pairs

Xiaomeng Wang, Xing Gao

A graph pair $(\hat{I}“,\hat{I}\pounds )$ is called stable if every automorphism of the direct product $\hat{I}“\times \hat{I}\pounds$ is induced componentwise by automorphisms of $\hat{I}“$ and $\hat{I}\pounds$. A graph is twin-free i…