scholarly journals ON THE STRUCTURE OF GRAPHS WHICH ARE LOCALLY INDISTINGUISHABLE FROM A LATTICE

2016 ◽  
Vol 4 ◽  
Author(s):  
ITAI BENJAMINI ◽  
DAVID ELLIS

For each integer $d\geqslant 3$, we obtain a characterization of all graphs in which the ball of radius $3$ around each vertex is isomorphic to the ball of radius 3 in $\mathbb{L}^{d}$, the graph of the $d$-dimensional integer lattice. The finite, connected graphs with this property have a highly rigid, ‘global’ algebraic structure; they can be viewed as quotient lattices of $\mathbb{L}^{d}$ in various compact $d$-dimensional orbifolds which arise from crystallographic groups. We give examples showing that ‘radius 3’ cannot be replaced by ‘radius 2’, and that ‘orbifold’ cannot be replaced by ‘manifold’. In the $d=2$ case, our methods yield new proofs of structure theorems of Thomassen [‘Tilings of the Torus and Klein bottle and vertex-transitive graphs on a fixed surface’, Trans. Amer. Math. Soc.323 (1991), 605–635] and of Márquez et al. [‘Locally grid graphs: classification and Tutte uniqueness’, Discrete Math.266 (2003), 327–352], and also yield short, ‘algebraic’ restatements of these theorems. Our proofs use a mixture of techniques and results from combinatorics, geometry and group theory.

10.37236/3915 ◽  
2016 ◽  
Vol 23 (3) ◽  
Author(s):  
Jin-Xin Zhou ◽  
Yan-Quan Feng

A bi-Cayley graph is a graph which admits a semiregular group of automorphisms with two orbits of equal size. In this paper, we give a characterization of cubic non-Cayley vertex-transitive bi-Cayley graphs over a regular $p$-group, where $p>5$ is an odd prime. As an application, a classification of cubic non-Cayley vertex-transitive graphs of order $2p^3$ is given for each prime $p$.


2008 ◽  
Vol 15 (03) ◽  
pp. 379-390 ◽  
Author(s):  
Xuesong Ma ◽  
Ruji Wang

Let X be a simple undirected connected trivalent graph. Then X is said to be a trivalent non-symmetric graph of type (II) if its automorphism group A = Aut (X) acts transitively on the vertices and the vertex-stabilizer Av of any vertex v has two orbits on the neighborhood of v. In this paper, such graphs of order at most 150 with the basic cycles of prime length are investigated, and a classification is given for such graphs which are non-Cayley graphs, whose block graphs induced by the basic cycles are non-bipartite graphs.


1994 ◽  
Vol 3 (4) ◽  
pp. 435-454 ◽  
Author(s):  
Neal Brand ◽  
Steve Jackson

In [11] it is shown that the theory of almost all graphs is first-order complete. Furthermore, in [3] a collection of first-order axioms are given from which any first-order property or its negation can be deduced. Here we show that almost all Steinhaus graphs satisfy the axioms of almost all graphs and conclude that a first-order property is true for almost all graphs if and only if it is true for almost all Steinhaus graphs. We also show that certain classes of subgraphs of vertex transitive graphs are first-order complete. Finally, we give a new class of higher-order axioms from which it follows that large subgraphs of specified type exist in almost all graphs.


Sign in / Sign up

Export Citation Format

Share Document