On Cayley graphs of.

The generating sets of have been enumerated which consist of integral four‐dimensional vectors with components −1, 0, 1 and allow Cayley graphs without edge intersections in a straight‐edge embedding in a four‐dimensional Euclidean space. Owing to computational restrictions the valency of enumerated graphs has been fixed to 10. Up to isomorphism 58 graphs have been found and characterized by coordination sequences, shortest cycles and automorphism groups. To compute automorphism groups, a novel strategy is introduced that is based on determining vertex stabilizers from the automorphism group of a sufficiently large finite ball cut out from an infinite graph. Six exceptional, rather 'dense' graphs have been identified which are locally isomorphic to a five‐dimensional cubic lattice within a ball of radius 10. They could be built by either interconnecting interpenetrated three‐ or four‐dimensional cubic lattices and therefore necessarily contain Hopf links between quadrangular cycles. As a consequence, a local combinatorial isomorphism does not extend to a local isotopy. [ABSTRACT FROM AUTHOR]