A Local Analysis of Imprimitive Symmetric Graphs

Let Г be a G-symmetric graph admitting a nontrivial G-invariant partition . Let Г be the quotient graph of Г with respect to . For each block B ∊ , the setwise stabiliser G_B of B in G induces natural actions on B and on the neighbourhood Г (B) of B in Г . Let G_(B) and G_[B] be respectively the kernels of these actions. In this paper we study certain “local actions" induced by G_(B) and G_[B], such as the action of G_[B] on B and the action of G_(B) on Г (B), and their influence on the structure of Г. Supported by a Discovery Project Grant (DP0558677) from the Australian Research Council and a Melbourne Early Career Researcher Grant from The University of Melbourne.     

Non-Cayley Vertex-Transitive Graphs of Order Twice the Product of Two Odd Primes

For a positive integer n, does there exist a vertex-transitive graph Γ on n vertices which is not a Cayley graph, or, equivalently, a graph Γ on n vertices such that Aut Γ is transitive on vertices but none of its subgroups are regular on vertices? Previous work (by Alspach and Parsons, Frucht, Graver and Watkins, Marusic and Scapellato, and McKay and the second author) has produced answers to this question if n is prime, or divisible by the square of some prime, or if n is the product of two distinct primes. In this paper we consider the simplest unresolved case for even integers, namely for integers of the form n = 2pq, where 2 < q < p, and p and q are primes. We give a new construction of an infinite family of vertex-transitive graphs on 2pq vertices which are not Cayley graphs in the case where p ≡ 1 (mod q). Further, if p ? 1 (mod q), p ≡ q ≡ 3(mod 4), and if every vertex-transitive graph of order pq is a Cayley graph, then it is shown that, either 2pq = 66, or every vertex-transitive graph of order 2pq admitting a transitive imprimitive group of automorphisms is a Cayley graph.     

Unitary Graphs

Unitary graphs are arc‐transitive graphs with vertices the flags of Hermitian unitals and edges defined by certain elements of the underlying finite fields. They played a significant role in a recent classification of a class of arc‐transitive graphs that admit an automorphism group acting imprimitively on the vertices. In this article, we prove that all unitary graphs are connected of diameter two and girth three. Based on this, we obtain, for any prime power , a lower bound of order on the maximum number of vertices in an arc‐transitive graph of degree and diameter two.     

Vertex‐Transitive Cubic Graphs of Square‐Free Order

A classification of connected vertex‐transitive cubic graphs of square‐free order is provided. It is shown that such graphs are well‐characterized metacirculants (including dihedrants, generalized Petersen graphs, Möbius bands), or Tutte's 8‐cage, or graphs arisen from simple groups PSL(2, p).     

A Classification of Regular Embeddings of Graphs of Order a Product of Two Primes

In this paper, we classify the regular embeddings of arc-transitive simple graphs of order pq for any two primes p and q (not necessarily distinct) into orientable surfaces. Our classification is obtained by direct analysis of the structure of arc-regular subgroups (with cyclic vertex-stabilizers) of the automorphism groups of such graphs. This work is independent of the classification of primitive permutation groups of degree p or degree pq for p q and it is also independent of the classification of the arc-transitive graphs of order pq for p q.     

Finite 2‐Geodesic Transitive Graphs of Prime Valency

We classify noncomplete prime valency graphs satisfying the property that their automorphism group is transitive on both the set of arcs and the set of 2‐geodesics. We prove that either Γ is 2‐arc transitive or the valency p satisfies , and for each such prime there is a unique graph with this property: it is a nonbipartite antipodal double cover of the complete graph with automorphism group and diameter 3.     

On Symmetric Cayley Graphs of Valency Eleven

A Cayley graph Γ=Cay(G,S)is said to be normal if G is normal in Aut Γ.In this paper,we investigate the normality problem of the connected 11-valent symmetric Cayley graphs Γ of finite nonabelian simple groups G,where the vertex stabilizer Av is soluble for A=Aut Γ and v ∈ VΓ.We prove that either Γ is normal or G=A5,A10,A54,A274,A549 or A1099.Further,11-valent symmetric nonnormal Cayley graphs of A5,A54 and A274 are constructed.This provides some more examples of nonnormal 11-valent symmetric Cayley graphs of finite nonabelian simple groups after the first graph of this kind(of valency 11)was constructed by Fang,Ma and Wang in 2011.     

On Cubic Graphs Admitting an Edge-Transitive Solvable Group

Using covering graph techniques, a structural result about connected cubic simple graphs admitting an edge-transitive solvable group of automorphisms is proved. This implies, among other, that every such graph can be obtained from either the 3-dipole Dip₃ or the complete graph K ₄, by a sequence of elementary-abelian covers. Another consequence of the main structural result is that the action of an arc-transitive solvable group on a connected cubic simple graph is at most 3-arc-transitive. As an application, a new infinite family of semisymmetric cubic graphs, arising as regular elementary abelian covering projections of K _3,3, is constructed.     

Locally Symmetric Graphs of Girth 4

We classify the family of connected, locally symmetric graphs of girth 4 (finite and infinite). They are all regular, with the exception of the complete bipartite graph . There are, up to isomorphism, exactly four such k‐regular graphs for every , one for , two for , and exactly three for every infinite cardinal k. In the last paragraph, we consider locally symmetric graphs of girth >4.     

Cubic vertex‐transitive graphs of order 2pq

A graph is vertex?transitive or symmetric if its automorphism group acts transitively on vertices or ordered adjacent pairs of vertices of the graph, respectively. Let G be a finite group and S a subset of G such that 1?S and S={s^?1 | s∈S}. The Cayleygraph Cay(G, S) on G with respect to S is defined as the graph with vertex set G and edge set {{g, sg} | g∈G, s∈S}. Feng and Kwak [J Combin Theory B 97 (2007), 627–646; J Austral Math Soc 81 (2006), 153–164] classified all cubic symmetric graphs of order 4p or 2p² and in this article we classify all cubic symmetric graphs of order 2pq, where p and q are distinct odd primes. Furthermore, a classification of all cubic vertex‐transitive non‐Cayley graphs of order 2pq, which were investigated extensively in the literature, is given. As a result, among others, a classification of cubic vertex‐transitive graphs of order 2pq can be deduced. © 2010 Wiley Periodicals, Inc. J Graph Theory 65: 285–302, 2010     

6p阶可解对称图的分类

设ｘ是简单无向图，Ｇ是Ａｕｔ（Ｘ）的一个于群，Ｘ称为Ｇ－对称的，如果Ｇ在ｘ的１－孤（即两相邻顶点构成的有序偶）集合上的作用是传递的；ｘ称为对称图，如果Ｘ是Ａｕｔ（ｘ）－对称的；ｘ称为可解对称的，如果Ａｕｔ（Ｘ）包含可解子群Ｇ，使Ｘ是Ｇ－对称的．本文给出了具有６Ｐ个顶点的可解对称图的一个分类，这里ｐ≥５是素数．     

On Connected Transversals to Subgroups Whose Order is a Product of Two Primes

We consider finite groups which have connected transversals to subgroups whose order is a product of two primespandq. We investigate those values ofpandqfor which the group is soluble. We can show that the solubility of the group follows ifq = 2 andp ≤ 61,q = 3 andp ≤ 31,q = 5 andp ≤ 11. We then apply our results on loop theory and we show that if the inner mapping group of a finite loop has orderpqwherepandqare as above then the loop is soluble.     

Finite 2‐Distance Transitive Graphs

A noncomplete graph Γ is said to be (G, 2)‐distance transitive if G is a subgroup of the automorphism group of Γ that is transitive on the vertex set of Γ, and for any vertex u of Γ, the stabilizer is transitive on the sets of vertices at distances 1 and 2 from u. This article investigates the family of (G, 2)‐distance transitive graphs that are not (G, 2)‐arc transitive. Our main result is the classification of such graphs of valency not greater than 5. We also prove several results about (G, 2)‐distance transitive, but not (G, 2)‐arc transitive graphs of girth 4.     

两个完全图的乘积的树宽

本文确定了乘积图Km×Kn的树宽.我们的结果是若m和n都是偶数,且m≥n,或m是奇数而n是偶数,或m和n都是奇数且n≥m,则Km×Kn的树宽是TW(Km×Kn)=n(m+1)/2-1.这恰好是图Km×Kn的带宽.     

Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs

In this article, we introduce and study the properties of some target graphs for 2‐edge‐colored homomorphism. Using these properties, we obtain in particular that the 2‐edge‐colored chromatic number of the class of triangle‐free planar graphs is at most 50. We also show that it is at least 12.     

A Conjecture Concerning a Limit of Non-Cayley Graphs

Our aim in this note is to present a transitive graph that we conjecture is not quasi-isometric to any Cayley graph. No such graph is currently known. Our graph arises both as an abstract limit in a suitable space of graphs and in a concrete way as a subset of a product of trees.     

Classification of edge‐transitive rose window graphs

Given natural numbers n?3 and 1?a, r?n?1, the rose window graph R_n(a, r) is a quartic graph with vertex set $\{{{x}}_{{i}}|{{i}}\in {\mathbb{Z}}_{{n}}\} \cup \{{{y}}_{{i}}|{{i}}\in{\mathbb{Z}}_{{n}}\}Given natural numbers n?3 and 1?a, r?n?1, the rose window graph R_n(a, r) is a quartic graph with vertex set $\{{{x}}_{{i}}|{{i}}\in {\mathbb{Z}}_{{n}}\} \cup \{{{y}}_{{i}}|{{i}}\in{\mathbb{Z}}_{{n}}\}$ and edge set $\{\{{{x}}_{{i}},{{x}}_{{{i+1}}}\} \mid {{i}}\in {\mathbb{Z}}_n \} \cup \{\{{{y}}_{{{i}}},{{y}}_{{{i+r}}}\}\mid {{i}} \in{\mathbb{Z}}_{{n}}\}\cup \{\{{{x}}_{{{i}}},{{y}}_{{{i}}}\} \mid {{i}}\in {\mathbb{Z}}_{{{n}}}\}\cup \{\{{{x}}_{{{i+a}}},{{y}}_{{{i}}}\} \mid{{i}} \in {\mathbb{Z}}_{{{n}}}\}$. In this article a complete classification of edge‐transitive rose window graphs is given, thus solving one of the three open problems about these graphs posed by Steve Wilson in 2001. © 2010 Wiley Periodicals, Inc. J Graph Theory 65: 216–231, 2010     

The Existence of a Bush-Type Hadamard Matrix of Order 324 and Two New Infinite Classes of Symmetric Designs

A symmetric 2-(324, 153, 72) design is constructed that admits a tactical decomposition into 18 point and block classes of size 18 such that every point is in either 0 or 9 blocks from a given block class, and every block contains either 0 or 9 points from a given point class. This design is self-dual and yields a symmetric Hadamard matrix of order 324 of Bush type, being the first known example of a symmetric Bush-type Hadamard matrix of order 4n ² for n > 1 odd. Equivalently, the design yields a strongly regular graph with parameters v=324, k=153, ==72 that admits a spread of cocliques of size 18. The Bush-type Hadamard matrix of order 324 leads to two new infinite classes of symmetric designs with parameters

Symmetric designs and projective special linear groups of dimension at most four

In this article, we study symmetric $\left(v,k,\lambda \right)$ designs admitting a flag‐transitive and point‐primitive automorphism group $G$ whose socle is isomorphic to a projective special linear group of dimension at most four. We, in particular, determine all such possible parameters $\left(v,k,\lambda \right)$ and show that such a design belongs to one of two infinite families of point‐hyperplane designs or it is isomorphic to a design with parameters (7, 3, 1), (7, 4, 2), (11, 5, 2), (11, 6, 3), (15, 8, 4), (35, 18, 9), or (56, 45, 18).