加载中…
The orthogonality graph of an Okubo algebra with isotropic norm over an arbitrary field is considered. Its connected components are described, and their diameters are computed. It is shown that there exist at most two shortest paths between any pair of vertices, and the conditions under which the shortest path is unique are determined.

生成讲解博客的中文版本

生成AI智能校验的中文版本