Automorphisms of Hyperbolic Groups and Graphs of Groups

Using the canonical JSJ splitting, we describe the outer automorphism group Out(G) of a one-ended word hyperbolic group G. In particular, we discuss to what extent Out(G) is virtually a direct product of mapping class groups and a free abelian group, and we determine for which groups Out(G) is infinite. We also show that there are only finitely many conjugacy classes of torsion elements in Out(G), for G any torsion-free hyperbolic group. More generally, let Γ be a finite graph of groups decomposition of an arbitrary group G such that edge groups G_e are rigid (i.e. Out(G_e) is finite). We describe the group of automorphisms of G preserving Γ, by comparing it to direct products of suitably defined mapping class groups of vertex groups.     

Strongly Regular Semi-Cayley Graphs

We consider strongly regular graphs = (V, E) on an even number, say 2n, of vertices which admit an automorphism group G of order n which has two orbits on V. Such graphs will be called strongly regular semi-Cayley graphs. For instance, the Petersen graph, the Hoffman–Singleton graph, and the triangular graphs T(q) with q 5 mod 8 provide examples which cannot be obtained as Cayley graphs. We give a representation of strongly regular semi-Cayley graphs in terms of suitable triples of elements in the group ring Z G. By applying characters of G, this approach allows us to obtain interesting nonexistence results if G is Abelian, in particular, if G is cyclic. For instance, if G is cyclic and n is odd, then all examples must have parameters of the form 2n = 4s ² + 4s + 2, k = 2s ² + s, = s ² – 1, and = s ²; examples are known only for s = 1, 2, and 4 (together with a noncyclic example for s = 3). We also apply our results to obtain new conditions for the existence of strongly regular Cayley graphs on an even number of vertices when the underlying group H has an Abelian normal subgroup of index 2. In particular, we show the nonexistence of nontrivial strongly regular Cayley graphs over dihedral and generalized quaternion groups, as well as over two series of non-Abelian 2-groups. Up to now these have been the only general nonexistence results for strongly regular Cayley graphs over non-Abelian groups; only the first of these cases was previously known.     

Distance-Regular Graphs with Strongly Regular Subconstituents

In [3] Cameron et al. classified strongly regular graphs with strongly regular subconstituents. Here we prove a theorem which implies that distance-regular graphs with strongly regular subconstituents are precisely the Taylor graphs and graphs with a ₁ = 0 and a _i {0,1} for i = 2,...,d.     

Cyclotomy and Strongly Regular Graphs

We consider strongly regular graphs defined on a finite field by taking the union of some cyclotomic classes as difference set. Several new examples are found.     

Galois Graphs: Walks, Trees and Automorphisms

Given a symmetric polynomial (x, y) over a perfect field k of characteristic zero, the Galois graph G() is defined by taking the algebraic closure as the vertex set and adjacencies corresponding to the zeroes of (x, y). Some graph properties of G(), such as lengths of walks, distances and cycles are described in terms of . Symmetry is also considered, relating the Galois group Gal( /k) to the automorphism group of certain classes of Galois graphs. Finally, an application concerning modular curves classifying pairs of isogeny elliptic curves is revisited.     

Spreads in Strongly Regular Graphs

A spread of a strongly regular graph is a partitionof the vertex set into cliques that meet Delsarte's bound (alsocalled Hoffman's bound). Such spreads give rise to coloringsmeeting Hoffman's lower bound for the chromatic number and tocertain imprimitive three-class association schemes. These correspondenceslead to conditions for existence. Most examples come from spreadsand fans in (partial) geometries. We give other examples, includinga spread in the McLaughlin graph. For strongly regular graphsrelated to regular two-graphs, spreads give lower bounds forthe number of non-isomorphic strongly regular graphs in the switchingclass of the regular two-graph.     

强正则图与Seidel变换

本文通过对图的Seidel变换进一步研究，得到了一些新的强正则图。     

强算术图

一个（p,q)-图G被为是强（k,d)-算术图,如果存在一个由G的顶点集到模q的整数群Zq的单射,使得相邻两顶点标号的和导出的边值为算术级数,k,k d,……,k (q-1)d,本文讨论了这类标号图的结构和一些性质。     

Small Directed Strongly Regular Graphs

The goal of the present paper is to provide a gallery of small directed strongly regular graphs.For each graph of order n≤12 and valency k相似文献   

A Generalization of Strongly Regular Graphs

Motivated from an example of ridge graphs relating to metric polytopes, a class of connected regular graphs such that the squares of their adjacency matrices are in certain symmetric Bose-Mesner algebras of dimension 3 is considered in this paper as a generalization of strongly regular graphs. In addition to analysis of this prototype example defined over (MetP₅)^*, some general properties of these graphs are studied from the combinatorial view point.AMS Subject Classification: 05E30.     

Binary Codes of Strongly Regular Graphs

For strongly regular graphs ith adjacency matrix A, we look at the binary codes generated by A and A + I. We determine these codes for some families of graphs, e pay attention to the relation beteen the codes of switching equivalent graphs and, ith the exception of two parameter sets, we generate by computer the codes of all knon strongly regular graphs on fewer than 45 vertices.     

Strongly Regular Graphs and Designs with Three Intersection Numbers

We investigate BIBDs with three intersection numbers,x, y, and z, such that the relation on the block set given byA B iff the cardinality of the intersectionof A and B is not equal to x is an equivalence relation. Withsuch a design, we associate a family of strongly regular graphswith the same parameters. Two constructions producing infinitefamilies of such designs are given.     

Bubble-sort图和Modified Bubble-sort图的自同构群

Bubble-Sort图和Modified Bubble-Sort图是两类特殊的Cayley图,由于其在网络构建中的应用而受到广泛关注.本文完全确定了这两类图的自同构群.     

Graph Automorphisms and Cells of Lattices

In this paper we apply the notion of cell of a lattice for dealing with graph automorphisms of lattices (in connection with a problem proposed by G. Birkhoff).     

强正则自补图的一个注记

Kotzig put forward a question on strongly-regular self-complementary graphs, that is, for any natural number k, whether there exists a strongly-regular self- complementary graph whose order is 4k 1, where 4k 1=x2 y2, x and y are positive integers; what is the minimum number that made there exist at least two non-isomorphic strongly-regular self-complementary graphs. In this paper, we use two famous lemmas to generalize the existential conditions for strongly-regular self-complementary circular graphs with 4k 1 orders.     

Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs

We prove the nonexistence of a distance-regular graph with intersection array {74,54,15;1,9,60} and of distance-regular graphs with intersection arrays

{4r³+8r²+6r+1,2r(r+1)(2r+1),2r²+2r+1;1,2r(r+1),(2r+1)(2r²+2r+1)}