16,519 research outputs found
Locally -distance transitive graphs
We give a unified approach to analysing, for each positive integer , a
class of finite connected graphs that contains all the distance transitive
graphs as well as the locally -arc transitive graphs of diameter at least
. A graph is in the class if it is connected and if, for each vertex ,
the subgroup of automorphisms fixing acts transitively on the set of
vertices at distance from , for each from 1 to . We prove that
this class is closed under forming normal quotients. Several graphs in the
class are designated as degenerate, and a nondegenerate graph in the class is
called basic if all its nontrivial normal quotients are degenerate. We prove
that, for , a nondegenerate, nonbasic graph in the class is either a
complete multipartite graph, or a normal cover of a basic graph. We prove
further that, apart from the complete bipartite graphs, each basic graph admits
a faithful quasiprimitive action on each of its (1 or 2) vertex orbits, or a
biquasiprimitive action. These results invite detailed additional analysis of
the basic graphs using the theory of quasiprimitive permutation groups.Comment: Revised after referee report
On the Spectrum of a Class of Distance-transitive Graphs
Let be the Cayley graph on the cyclic additive group where , \dots , are the inverse-closed subsets of for any , . In this paper, we will show that if and only if . Also, we will show that if is an even integer and then where and in this case, we show that is an integral graph
ON A CLASS OF EDGE-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS
The paper is devoted to the problem of classification of edge-transitive distance-regular antipodal covers of complete graphs. This extends the classification of those covers that are arc-transitive, which has been settled except for some tricky cases that remain to be considered, including the case of covers satisfying condition (which means that every two vertices at distance 2 have exactly one common neighbour).Here it is shown that an edge-transitive distance-regular antipodal cover of a complete graph with is either the second neighbourhood of a vertex in a Moore graph of valency 3 or 7, or a Mathon graph, or a half-transitive graph whose automorphism group induces an affine -homogeneous group on the set of its fibres. Moreover, distance-regular antipodal covers of complete graphs with that admit an automorphism group acting -homogeneously on the set of fibres (which turns out to be an approximation of the property of edge-transitivity of such cover), are described. A well-known correspondence between distance-regular antipodal covers of complete graphs with and geodetic graphs of diameter two that can be viewed as underlying graphs of certain Moore geometries, allows us to effectively restrict admissible automorphism groups of covers under consideration by combining Kantor's classification of involutory automorphisms of these geometries together with the classification of finite 2-homogeneous permutation groups
Generalized hypercubes and (0,2)-graphs
AbstractA generalized hypercube Qd(S) (S ⊆ {1, 2, …, d}) has {0,1}d as vertex set and two vertices are joined whenever their mutual distance in Qd belongs to S. These graphs have been introduced in (Berrachedi and Mollard, 1996) where the notion mainly investigated there is graph embedding, especially, in the case where the host graph is a hypercube. A simple connected graph G is a (0, 2)-graph if any two vertices have 0 or exactly two common neighbors as introduced in (Mulder, 1980). We give first some results about the structure of generalized hypercubes, and then characterize those of which are (0, 2)-graphs. Using similar construction as in generalized hypercubes, we exhibit a class of (0, 2)-graphs which are not vertex transitive which contradicts again a conjecture of Mulder (1982) on the convexity of interval regular graphs
On a Class of Edge-Transitive Distance-Regular Antipodal Covers of Complete Graphs
The paper is devoted to the problem of classification of edge-transitive distance-regular antipodal covers of complete graphs. This extends the classification of those covers that are arc-transitive, which has been settled except for some tricky cases that remain to be considered, including the case of covers satisfying condition c2=1 (which means that every two vertices at distance 2 have exactly one common neighbour). Here it is shown that an edge-transitive distance-regular antipodal cover of a complete graph with c2=1 is either the second neighbourhood of a vertex in a Moore graph of valency 3 or 7, or a Mathon graph, or a half-transitive graph whose automorphism group induces an affine 2-homogeneous group on the set of its fibres. Moreover, distance-regular antipodal covers of complete graphs with c2=1 that admit an automorphism group acting 2-homogeneously on the set of fibres (which turns out to be an approximation of the property of edge-transitivity of such cover), are described. A well-known correspondence between distance-regular antipodal covers of complete graphs with c2=1 and geodetic graphs of diameter two that can be viewed as underlying graphs of certain Moore geometries, allows us to effectively restrict admissible automorphism groups of covers under consideration by combining Kantor's classification of involutory automorphisms of these geometries together with the classification of finite 2-homogeneous permutation groups.This work was supported by the Russian Science Foundation under grant no. 20-71-00122
- …