距离可迁图在笛卡尔积下封闭的条件

THE CONDITION OF CLOSENESS ON CARTESIAN PRODUCT OF TWO DTG'S

本文证明了两个距离可迁图г,г’的笛卡尔积г×г’是距离可迁图当且仅当:г,г’是超立方图,并且г=г(n,q),г’=г(n’,q)。

This paper proved the following result: The Cartesian product г×г' of two distance transtive graphs г, г'is a distance transitive graph if and only if: г,г'are Hypercubic graphs, and г=г(n,q), г'=г(n',q).