On the classification of quartic half-arc-transitive metacirculants

A half-arc-transitive graph is a vertex- and edge- but not arc-transitive graph. Following Alspach and Parsons, a metacirculant graph is a graph admitting a transitive group generated by two automorphisms ρ and σ, where ρ is (m,n)-semiregular for some integers m≥1 and n≥2, and where σ normalizes ρ, cyclically permuting the orbits of ρ in such a way that σ^m has at least one fixed vertex. In a recent paper Maruši? and the author showed that each connected quartic half-arc-transitive metacirculant belongs to one (or possibly more) of four classes of such graphs, reflecting the structure of the quotient graph relative to the semiregular automorphism ρ. One of these classes coincides with the class of the so-called tightly-attached graphs, which have already been completely classified. In this paper a complete classification of the second of these classes, that is the class of quartic half-arc-transitive metacirculants for which the quotient graph relative to the semiregular automorphism ρ is a cycle with a loop at each vertex, is given.     

A classification of tightly attached half-arc-transitive graphs of valency 4

A graph is said to be half-arc-transitive if its automorphism group acts transitively on the set of its vertices and edges but not on the set of its arcs. With each half-arc-transitive graph of valency 4 a collection of the so-called alternating cycles is associated, all of which have the same even length. Half of this length is called the radius of the graph in question. Moreover, any two adjacent alternating cycles have the same number of common vertices. If this number, the so-called attachment number, coincides with the radius, we say that the graph is tightly attached. In [D. Marušič, Half-transitive group actions on finite graphs of valency 4, J. Combin. Theory Ser. B 73 (1998) 41–76], Marušič gave a classification of tightly attached half-arc-transitive graphs of valency 4 with odd radius. In this paper the even radius tightly attached graphs of valency 4 are classified, thus completing the classification of all tightly attached half-arc-transitive graphs of valency 4.     

Constructing even radius tightly attached half-arc-transitive graphs of valency four

A finite graph X is half-arc-transitive if its automorphism group is transitive on vertices and edges, but not on arcs. When X is tetravalent, the automorphism group induces an orientation on the edges and a cycle of X is called an alternating cycle if its consecutive edges in the cycle have opposite orientations. All alternating cycles of X have the same length and half of this length is called the radius of X. The graph X is said to be tightly attached if any two adjacent alternating cycles intersect in the same number of vertices equal to the radius of X. Marušič (J. Comb. Theory B, 73, 41–76, 1998) classified odd radius tightly attached tetravalent half-arc-transitive graphs. In this paper, we classify the half-arc-transitive regular coverings of the complete bipartite graph K _4,4 whose covering transformation group is cyclic of prime-power order and whose fibre-preserving group contains a half-arc-transitive subgroup. As a result, two new infinite families of even radius tightly attached tetravalent half-arc-transitive graphs are constructed, introducing the first infinite families of tetravalent half-arc-transitive graphs of 2-power orders.      

Almost all quartic half-arc-transitive weak metacirculants of Class II are of Class IV

A half-arc-transitive graph is a vertex- and edge- but not arc-transitive graph. A weak metacirculant is a graph admitting a transitive metacyclic group that is a group generated by two automorphisms ρ and σ, where ρ is (m,n)-semiregular for some integers m≥1 and n≥2, and where σ normalizes ρ. It was shown in [D. Maruši?, P. Šparl, On quartic half-arc-transitive metacirculants, J. Algebr. Comb. 28 (2008) 365-395] that each connected quartic half-arc-transitive weak metacirculant X belongs to one (or possibly more) of four classes of such graphs, reflecting the structure of the quotient graph X_ρ relative to the semiregular automorphism ρ. The first of these classes, called Class I, coincides with the class of so-called tightly attached graphs. Class II consists of the quartic half-arc-transitive weak metacirculants for which the quotient graph X_ρ is a cycle with a loop at each vertex. Class III consists of those graphs for which each vertex of the quotient graph X_ρ is connected to three other vertices, to one with a double edge. Finally, Class IV consists of those graphs for which X_ρ is a simple quartic graph.This paper consists of two results concerning graphs of Class II. It is shown that, with the exception of the Doyle-Holt graph and its canonical double cover, each quartic half-arc-transitive weak metacirculant of Class II is also of Class IV. It is also shown that although quartic half-arc-transitive weak metacirculants of Class II which are not tightly attached exist they are “almost tightly attached”. More precisely, their radius is at most four times their attachment number.     

On the radius and the attachment number of tetravalent half-arc-transitive graphs

In this paper, we study the relationship between the radius $r$ and the attachment number $a$ of a tetravalent graph admitting a half-arc-transitive group of automorphisms. These two parameters were first introduced in Maru?i? (1998), where among other things it was proved that $a$ always divides $2r$. Intrigued by the empirical data from the census (Poto?nik et al., 2015) of all such graphs of order up to 1000 we pose the question of whether all examples for which $a$ does not divide $r$ are arc-transitive. We prove that the answer to this question is positive in the case when $a$ is twice an odd number. In addition, we completely characterise the tetravalent graphs admitting a half-arc-transitive group with $r=3$ and $a=2$, and prove that they arise as non-sectional split $2$-fold covers of line graphs of $2$-arc-transitive cubic graphs.     

A construction of pseudo metacirculants

Metacirculants were introduced by Alspach and Parsons in 1982 and have been a rich source of various topics since then. It is known that every metacirculant is a split weak metacirculant (A graph is called (split) weak metacirculant if it has a vertex-transitive (split) metacyclic subgroup of automorphisms). We say that a split metacirculant is a pseudo metacirculant if it is not metacirculant. In this paper, an infinite family of pseudo metacirculants is constructed, and this provides a negative answer to Question A in Zhou and Zhou (2018).     

On Compact Graphs

Let G be a finite simple graph with adjacency matrix A, and let P（A） be the convex closure of the set of all permutation matrices commuting with A. G is said to be compact if every doubly stochastic matrix which commutes with A is in P（A）. In this paper, we characterize 3-regular compact graphs and prove that if G is a connected regular compact graph, G - v is also compact, and give a family of almost regular compact connected graphs.     

On the fixing sets of dihedral groups

The fixing number of a graph $\Gamma$ is the minimum number of labeled vertices that, when fixed, remove all nontrivial automorphisms from the automorphism group of $\Gamma$. The fixing set of a finite group $G$ is the set of all fixing numbers of graphs whose automorphism groups are isomorphic to $G$. Previously, authors have studied the fixing sets of both abelian groups and symmetric groups. In this article, we determine the fixing set of the dihedral group.     

A Generalization of Noncommuting Graph via Automorphisms of a Group

Let G be a group. By using a family 𝒜 of subsets of automorphisms of G, we introduced a simple graph Γ_𝒜(G), which is a generalization of the non-commuting graph. In this paper, we study the combinatorial properties of Γ_𝒜(G).     

On the action of a group on a graph, II

This paper is a continuation of the survey by the author (V.I. Trofimov, On the action of a group on a graph, Acta Appl. Math. 29 (1992) 161–170) on some results concerning groups of automorphisms of locally finite vertex-symmetric graphs.     

图的可定向嵌入的标根可数性

给定一族图G,可定向曲面上存在多少个以其中某个图为基础图的标根地图？采用图的自同构群对图在可定向曲面上的嵌入集合进行分类，该文解决了这个问题，同时得到了求解计数函数f^r(M)的一种新的方法。     

Vertex-minimal graphs with dihedral symmetry I

Let $D_{2n}$ denote the dihedral group of order $2n$, where $n\ge 3$. In this article, we build upon the findings of Haggard and McCarthy who, for certain values of $n$, produced a vertex-minimal graph with dihedral symmetry. Specifically, Haggard considered the situation when $\frac{n}{2}$ or $n$ is a prime power, and McCarthy investigated the case when $n$ is not divisible by $2$, $3$ or $5$. In this article, we assume $n$ is not divisible by $4$ and construct a vertex-minimal graph whose automorphism group is isomorphic to $D_{2n}$.     

4度对称循环图的分类(英文)

本文刻划了所有4度有向和无内循环图．