Results 1  10
of
29
A geometrical approach to imprimitive graphs
 PROC. LONDON MATH. SOC
, 1995
"... We establish a geometrical framework for the study of imprimitive, Gsymmetric graphs F by exploiting the fact that any Gpartition B of the vertex set VT gives rise both to a quotient graph fB and to a tactical configuration D(B) induced on each block BeB. We also examine those cases in which D(B) ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
We establish a geometrical framework for the study of imprimitive, Gsymmetric graphs F by exploiting the fact that any Gpartition B of the vertex set VT gives rise both to a quotient graph fB and to a tactical configuration D(B) induced on each block BeB. We also examine those cases in which D(B) is degenerate, and characterize the possible graphs f in many cases where the quotient FB is either a complete graph or a circuit. When D(fl) is nondegenerate, a natural extremal case occurs when D(B) is a symmetric 2design with stabilizer G(B) acting doubly transitively on points: we characterize such graphs in the case where TB is complete.
Applications and adaptations of the low index subgroups procedure
 MATH. COMP
, 2005
"... The lowindex subgroups procedure is an algorithm for finding all subgroups of up to a given index in a finitely presented group G and hence for determining all transitive permutation representations of G of small degree. A number of significant applications of this algorithm are discussed, in parti ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
The lowindex subgroups procedure is an algorithm for finding all subgroups of up to a given index in a finitely presented group G and hence for determining all transitive permutation representations of G of small degree. A number of significant applications of this algorithm are discussed, in particular to the construction of graphs and surfaces with large automorphism groups. Furthermore, three useful adaptations of the procedure are described, along with parallelisation of the algorithm. In particular, one adaptation finds all complements of a given finite subgroup (in certain contexts), and another finds all normal subgroups of small index in the group G. Significant recent applications of these are also described in some detail.
Cubic vertextransitive graphs on up to 1280 vertices
 J. Symbolic Comput
"... Abstract. A graph is called cubic and tetravalent if all of its vertices have valency 3 and 4, respectively. It is called vertextransitive and arctransitive if its automorphism group acts transitively on its vertexset and on its arcset, respectively. In this paper, we combine some new theoretica ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
Abstract. A graph is called cubic and tetravalent if all of its vertices have valency 3 and 4, respectively. It is called vertextransitive and arctransitive if its automorphism group acts transitively on its vertexset and on its arcset, respectively. In this paper, we combine some new theoretical results with computer calculations to construct all cubic vertextransitive graphs of order at most 1280. In the process, we also construct all tetravalent arctransitive graphs of order at most 640. 1.
Group Actions on Graphs, Maps and Surfaces with Maximum Symmetry
 in: Groups St Andrews 2001 in Oxford, London Math. Soc. Lecture Note Series
, 2003
"... This is a summary of a short course of lectures given at the Groups St Andrews conference in Oxford, August 2001, on the signi cant role of combinatorial group theory in the study of objects possessing a high degree of symmetry. Topics include group actions on closed surfaces, regular maps, and ni ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
(Show Context)
This is a summary of a short course of lectures given at the Groups St Andrews conference in Oxford, August 2001, on the signi cant role of combinatorial group theory in the study of objects possessing a high degree of symmetry. Topics include group actions on closed surfaces, regular maps, and nite sarctransitive graphs for large values of s. A brief description of the use of Schreier coset graphs and computational methods for handling nitelypresented groups and their images is also given.
An infinite family of 4arctransitive cubic graphs each with girth 12
 Bull. London Math. Soc
, 1989
"... If p is any prime, and 6 is that automorphism of the group SL(3,/>) which takes each matrix to the transpose of its inverse, then there exists a connected trivalent graph F(p) on ^p 3 (p 3 —\)(p 2 — \) vertices with the split extension SL(3,/?)<0> as a group of automorphisms acting regularl ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
If p is any prime, and 6 is that automorphism of the group SL(3,/>) which takes each matrix to the transpose of its inverse, then there exists a connected trivalent graph F(p) on ^p 3 (p 3 —\)(p 2 — \) vertices with the split extension SL(3,/?)<0> as a group of automorphisms acting regularly on its 4arcs. In fact if/? / 3 then this group is the full automorphism group of f(p), while the graph F(3) is 5arctransitive with full automorphism group SL(3,3)<0> x C2. The girth of F(p) is 12, except in the case p = 2 (where the girth is 6). Furthermore, in all cases F(p) is bipartite, with SL(3,p) fixing each part. Also when p = 1 mod 3 the graph T(p) is a triple cover of another trivalent graph, which has automorphism group PSL(3,p)<0> acting regularly on its 4arcs. These claims are proved using elementary theory of symmetric graphs, together with a suitable choice of three matrices which generate SL(3, Z). They also provide a proof that the group 4 + (a 12) described by Biggs in Computational group theory (ed. M. Atkinson) is infinite.
Symmetric cubic graphs of small girth
"... A graph Γ is symmetric if its automorphism group acts transitively on the arcs of Γ, and sregular if its automorphism group acts regularly on the set of sarcs of Γ. Tutte (1947, 1959) showed that every cubic finite symmetric cubic graph is sregular for some s ≤ 5. We show that a symmetric cubic g ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
(Show Context)
A graph Γ is symmetric if its automorphism group acts transitively on the arcs of Γ, and sregular if its automorphism group acts regularly on the set of sarcs of Γ. Tutte (1947, 1959) showed that every cubic finite symmetric cubic graph is sregular for some s ≤ 5. We show that a symmetric cubic graph of girth at most 9 is either 1regular or 2 ′regular (following the notation of Djokovic), or belongs to a small family of exceptional graphs. On the other hand, we show that there are infinitely many 3regular cubic graphs of girth 10, so that the statement for girth at most 9 cannot be improved to cubic graphs of larger girth. Also we give a characterisation of the 1 or 2 ′regular cubic graphs of girth g ≤ 9, proving that with five exceptions these are closely related with quotients of the triangle group ∆(2,3,g) in each case, or of the group 〈x,y x 2 = y 3 = [x,y] 4 = 1 〉 in the case g = 8. All the 3transitive cubic graphs and exceptional 1 and 2regular cubic graphs of girth at most 9 appear in the list of cubic symmetric graphs up to 768 vertices produced by Conder and Dobcsányi (2002); the largest is the 3regular graph F570 of order 570 (and girth 9). The proofs of the main results are computerassisted. Keywords: Arctransitive graph, sregular graph, girth, triangle group, regular map
On a class of finite symmetric graphs
 EUROPEAN JOURNAL OF COMBINATORICS
, 2007
"... Let Γ be a Gsymmetric graph, and let B be a nontrivial Ginvariant partition of the vertex set of Γ. This paper aims to characterize (Γ, G) under the conditions that the quotient graph Γ B is (G, 2)arc transitive and the induced subgraph between two adjacent blocks is 2 · K2 or K2,2. The results ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Let Γ be a Gsymmetric graph, and let B be a nontrivial Ginvariant partition of the vertex set of Γ. This paper aims to characterize (Γ, G) under the conditions that the quotient graph Γ B is (G, 2)arc transitive and the induced subgraph between two adjacent blocks is 2 · K2 or K2,2. The results answer two questions about the relationship between Γ and Γ B for this class of graphs.
Computers and Discovery in Algebraic Graph Theory
 Edinburgh, 2001), Linear Algebra Appl
, 2001
"... We survey computers systems which help to obtain and sometimes provide automatically conjectures and refutations in algebraic graph theory. ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We survey computers systems which help to obtain and sometimes provide automatically conjectures and refutations in algebraic graph theory.
Finite Symmetric Graphs with TwoArc Transitive Quotients II
, 2006
"... DOI 10.1002/jgt.20260 Abstract: Let Ɣ be a finite Gsymmetric graph whose vertex set admits a nontrivial Ginvariant partition B. It was observed that the quotient graph ƔB of Ɣ relative to B can be (G, 2)arc transitive even if Ɣ itself is not necessarily (G, 2)arc transitive. In a previous articl ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
DOI 10.1002/jgt.20260 Abstract: Let Ɣ be a finite Gsymmetric graph whose vertex set admits a nontrivial Ginvariant partition B. It was observed that the quotient graph ƔB of Ɣ relative to B can be (G, 2)arc transitive even if Ɣ itself is not necessarily (G, 2)arc transitive. In a previous article of Iranmanesh et al., this observation motivated a study of Gsymmetric graphs (Ɣ, B) such that ƔB is (G, 2)arc transitive and, for blocks B, C ∈ B adjacent in ƔB, there are exactly B−2(≥1) vertices in B which have neighbors in C. In the present article we investigate the general case where ƔB is (G, 2)arc transitive and is not multicovered by Ɣ (i.e., at least one vertex in B has no neighbor in C for adjacent B, C ∈ B) by analyzing the dual D ∗ (B) of the 1design