共查询到20条相似文献,搜索用时 15 毫秒
1.
A graph is called s-regular if its automorphism group acts regularly on the set of its s-arcs. In this paper, the s-regular cyclic or elementary abelian coverings of the Petersen graph for each s ⩾ 1 are classified when the fibre-preserving automorphism groups act arc-transitively. As an application of these results,
all s-regular cubic graphs of order 10p or 10p
2 are also classified for each s ⩾ 1 and each prime p, of which the proof depends on the classification of finite simple groups. 相似文献
2.
A graph is called s-regular if its automorphism group acts regularly on the set of its s-arcs. In this paper, the s-regular cyclic or elementary abelian coverings of the Petersen graph for each s ? 1 are classified when the fibre-preserving automorphism groups act arc-transitively. As an application of these results, all s-regular cubic graphs of order 10p or 10p 2 are also classified for each s ? 1 and each prime p, of which the proof depends on the classification of finite simple groups. 相似文献
3.
4.
A graph is symmetric if its automorphism group acts transitively on the set of arcs of the graph. In this paper, we classify hexavalent symmetric graphs of order for each prime . 相似文献
5.
A regular edge-transitive graph is said to be semisymmetric if it is not vertex-transitive.By Folkman [J.Combin.Theory 3(1967),215-232],there is no semisymmetric graph of order 2p or 2p 2 for a prime p,and by Malni et al.[Discrete Math.274(2004),187-198],there exists a unique cubic semisymmetric graph of order 2p 3,the so called Gray graph of order 54.In this paper,it is shown that there is no connected cubic semisymmetric graph of order 4p 3 and that there exists a unique cubic semisymmetric graph of orde... 相似文献
6.
LU Zaiping WANG Changqun & XU MingyaoLMAM School of Mathematical Sciences Peking University Beijing China Department of Mathematics Zhengzhou University Zhengzhou ChinaPresent address: Department of Mathematics Qufu Normal University Qufu China. 《中国科学A辑(英文版)》2004,47(1):1-17
A graph r is said to be G-semisymmetric if it is regular and there exists a subgroup G of A := Aut(Г) acting transitively on its edge set but not on its vertex set. In the case of G. = A, we call r a semisymmetric graph. The aim of this paper is to investigate (G-)semisymmetric graphs of prime degree. We give a group-theoretical construction of such graphs, and give a classification of semisymmetric cubic graphs of order 6p2 for an odd prime p. 相似文献
7.
8.
A regular cover of a connected graph is called dihedral or cyclic if its transformation group is dihedral or cyclic, respectively. Let X be a connected cubic symmetric graph of order 2p for a prime p. Several publications have investigated the classification of edge-transitive dihedral or cyclic covers of X for specific p. The edge-transitive dihedral covers of X have been classified for p=2 and the edge-transitive cyclic covers of X have been classified for p≤5. In this paper an extension of the above results to an arbitrary prime p is presented. 相似文献
9.
A regular graph X is called semisymmetric if it is edge-transitive but not vertex-transitive. For G ≤ AutX, we call a G-cover X semisymmetric if X is semisymmetric, and call a G-cover X one-regular if Aut X acts regularly on its arc-set. In this paper, we give the sufficient and necessary conditions for the existence of one-regular or semisymmetric Zn-Covers of K3,3. Also, an infinite family of semisymmetric Zn×Zn-covers of K3,3 are constructed. 相似文献
10.
《Journal of Graph Theory》2018,88(4):631-640
The 3‐Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2‐regular subgraph and a matching. We show that this conjecture holds for the class of connected plane cubic graphs. 相似文献
11.
A graph is called edge-transitive if its full automorphism group acts transitively on its edge set.In this paper,by using classification of finite simple groups,we classify tetravalent edge-transitive graphs of order p2q with p,q distinct odd primes.The result generalizes certain previous results.In particular,it shows that such graphs are normal Cayley graphs with only a few exceptions of small orders. 相似文献
12.
13.
A graph is symmetric or 1-regular if its automorphism group is transitive or regular on the arc set of the graph, respectively. We classify the connected pentavalent symmetric graphs of order 2p~3 for each prime p. All those symmetric graphs appear as normal Cayley graphs on some groups of order 2p~3 and their automorphism groups are determined. For p = 3, no connected pentavalent symmetric graphs of order 2p~3 exist. However, for p = 2 or 5, such symmetric graph exists uniquely in each case. For p 7, the connected pentavalent symmetric graphs of order 2p~3 are all regular covers of the dipole Dip5 with covering transposition groups of order p~3, and they consist of seven infinite families; six of them are 1-regular and exist if and only if 5 |(p- 1), while the other one is 1-transitive but not 1-regular and exists if and only if 5 |(p ± 1). In the seven infinite families, each graph is unique for a given order. 相似文献
14.
15.
16.
17.
We describe work on the relationship between the independently-studied polygon-circle graphs and word-representable graphs.A graph G = (V, E) is word-representable if there exists a word w over the alpha-bet V such that letters x and y form a subword of the form xyxy ⋯ or yxyx ⋯ iff xy is an edge in E. Word-representable graphs generalise several well-known and well-studied classes of graphs [S. Kitaev, A Comprehensive Introduction to the Theory of Word-Representable Graphs, Lecture Notes in Computer Science 10396 (2017) 36–67; S. Kitaev, V. Lozin, “Words and Graphs”, Springer, 2015]. It is known that any word-representable graph is k-word-representable, that is, can be represented by a word having exactly k copies of each letter for some k dependent on the graph. Recognising whether a graph is word-representable is NP-complete ([S. Kitaev, V. Lozin, “Words and Graphs”, Springer, 2015, Theorem 4.2.15]). A polygon-circle graph (also known as a spider graph) is the intersection graph of a set of polygons inscribed in a circle [M. Koebe, On a new class of intersection graphs, Ann. Discrete Math. (1992) 141–143]. That is, two vertices of a graph are adjacent if their respective polygons have a non-empty intersection, and the set of polygons that correspond to vertices in this way are said to represent the graph. Recognising whether an input graph is a polygon-circle graph is NP-complete [M. Pergel, Recognition of polygon-circle graphs and graphs of interval filaments is NP-complete, Graph-Theoretic Concepts in Computer Science: 33rd Int. Workshop, Lecture Notes in Computer Science, 4769 (2007) 238–247]. We show that neither of these two classes is included in the other one by showing that the word-representable Petersen graph and crown graphs are not polygon-circle, while the non-word-representable wheel graph W5 is polygon-circle. We also provide a more refined result showing that for any k ≥ 3, there are k-word-representable graphs which are neither (k −1)-word-representable nor polygon-circle. 相似文献
18.
A graph is said to be symmetric if its automorphism group acts transitively on its arcs. In this paper, a complete classification of connected pentavalent symmetric graphs of order 16p is given for each prime p. It follows from this result that a connected pentavalent symmetric graph of order 16p exists if and only if p = 2 or 31, and that up to isomorphism, there are three such graphs. 相似文献
19.
WANG FuRong & DU ShaoFei School of Information Beijing Wuzi University Beijing China School of Mathematical Sciences Capital Normal University Beijing 《中国科学 数学(英文版)》2011,(2)
In [J. Algeb. Combin. 19(2004), 123-141], Du et al. classified the orientable regular embeddings of connected simple graphs of order pq for any two primes p and q. In this paper, we shall classify the nonorientable regular embeddings of these graphs, where p ≠ q. Our classification depends on the classification of primitive permutation groups of degree p and degree pq but is independent of the classification of the arc-transitive graphs of order pq. 相似文献