12 research outputs found
Recent trends and future directions in vertex-transitive graphs
A graph is said to be vertex-transitive if its automorphism group acts transitively on the vertex set. Some recent developments and possible future directions regarding two famous open problems, asking about existence of Hamilton paths and existence of semiregular automorphisms in vertex-transitive graphs, are discussed, together with some recent results on arc-transitive graphs and half-arc-transitive graphs, two special classes of vertex-transitive graphs that have received particular attention over the last decade
There exists no tetravalent half-arc-transitive graph of order 2p2
AbstractA graph is half-arc-transitive if its automorphism group acts transitively on its vertex set, edge set, but not arc set. In this paper, we show that there is no tetravalent half-arc-transitive graph of order 2p2