Symmetrical 2-extensions of the 3-dimensional grid. I

Abstract

For a positive integer d, a connected graph is a symmetrical 2-extension of the d-dimensional grid d if there exists a vertex-tran\-sitive group G of automorphisms of and its imprimitivity system σ with blocks of order 2 such that there exists an isomorphism of the quotient graph /σ onto d. The tuple (, G, σ, ) with specified components is called a realization of the symmetrical 2-extension of the grid d. Two realizations (1, G1, σ1, 1) and (2, G2, σ2, 2) are called equivalent if there exists an isomorphism of the graph 1 onto 2 which maps σ1 onto σ2. V. Trofimov proved that, up to equivalence, there are only finitely many realizations of symmetrical 2-extensions of d for each positive integer d. E. Konovalchik and K. Kostousov found all, up to equivalence, realizations of symmetrical 2-extensions of the grid 2. In this work we found all, up to equivalence, realizations (, G, σ, ) of symmetrical 2-extensions of the grid 3 for which only the trivial automorphism of preserves all blocks of σ (we prove that there are 5573 such realizations, and that among corresponding graphs there are 5350 pairwise non-isomorphic).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…