In this paper, we investigate semisymmetric graphs of order 6p2 and of prime valency. First, we give a classification of the quasiprimitive permutation groups of degree dividing 3p2, and then, on the basis of the clas...In this paper, we investigate semisymmetric graphs of order 6p2 and of prime valency. First, we give a classification of the quasiprimitive permutation groups of degree dividing 3p2, and then, on the basis of the classification result, we prove that, for primes k and p, a connected graph Γ of order 6p2 and valency k is semisymmetric if and only if k = 3 and either Γ is the Gray graph, or p ≡ 1 (mod 6) and Γ is isomorphic to one known graph.展开更多
A regular edge-transitive graph is said to be semisymmetric if it is mot 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...A regular edge-transitive graph is said to be semisymmetric if it is mot 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 Malni6 et al. [Discrete Math. 274 （2004）, 18-198], there exists a unique cubic semisymmetrie graph of order 2p3, 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 order 8p3, which is a Z2 × Z2-covering of the Gray graph.展开更多
Let Γ be a connected regular bipartite graph of order 18 p, where p is a prime. Assume that Γ admits a group acting primitively on one of the bipartition subsets of Γ. Then, in this paper, it is shown that eitherΓ...Let Γ be a connected regular bipartite graph of order 18 p, where p is a prime. Assume that Γ admits a group acting primitively on one of the bipartition subsets of Γ. Then, in this paper, it is shown that eitherΓ is arc-transitive, or Γ is isomorphic to one of 17 semisymmetric graphs which are constructed from primitive groups of degree 9p.展开更多
A simple undirected regular graph is said to be semisymmetric if it is edge-transitive but not vertex-transitive.For a semisymmetric graphΓof order 2p^(3),p a prime,it is well known thatΓis bipartite with two bipart...A simple undirected regular graph is said to be semisymmetric if it is edge-transitive but not vertex-transitive.For a semisymmetric graphΓof order 2p^(3),p a prime,it is well known thatΓis bipartite with two biparts having equal size.The complete classification of such graphs has been given for the full automorphism group Aut(Γ)acting unfaithfully on at least one bipart ofΓ,which shows that there is only one infinite family of such graphs with valency p^(2).The graphs of this kind have been determined when Aut(Γ)acts faithfully and primitively on at least one bipart ofΓ,and thus there is only one remaining case for classifying such graphs of valency p^(2),Aut(Γ)acting faithfully and imprimitively on both biparts ofΓ,which is dealt with in this paper.As a result,there is only one infinite family of semisymmetric graphs of order 2p^(3)with valency p^(2).展开更多
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 regu...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.展开更多
文摘In this paper, we investigate semisymmetric graphs of order 6p2 and of prime valency. First, we give a classification of the quasiprimitive permutation groups of degree dividing 3p2, and then, on the basis of the classification result, we prove that, for primes k and p, a connected graph Γ of order 6p2 and valency k is semisymmetric if and only if k = 3 and either Γ is the Gray graph, or p ≡ 1 (mod 6) and Γ is isomorphic to one known graph.
基金supported by National Natural Science Foundation of China (Grant No.10871021)the Specialized Research Fund for the Doctoral Program of Higher Education in China (Grant No.20060004026)
文摘A regular edge-transitive graph is said to be semisymmetric if it is mot 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 Malni6 et al. [Discrete Math. 274 （2004）, 18-198], there exists a unique cubic semisymmetrie graph of order 2p3, 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 order 8p3, which is a Z2 × Z2-covering of the Gray graph.
基金supported by National Natural Science Foundation of China(Grant Nos.11271267 and 11371204)
文摘Let Γ be a connected regular bipartite graph of order 18 p, where p is a prime. Assume that Γ admits a group acting primitively on one of the bipartition subsets of Γ. Then, in this paper, it is shown that eitherΓ is arc-transitive, or Γ is isomorphic to one of 17 semisymmetric graphs which are constructed from primitive groups of degree 9p.
基金partially supported by the Mathematical Tianyuan Foundation of China(11426093,12126317)National Natural Science Foundation of China(11501172,11301154)+1 种基金Natural Science Foundation of Henan Province,Fundamental Research Funds for the Universities of Henan Province(NSFRF240316)Young Core Teacher Foundation of Henan Polytechnic University(2023XQG-11).
文摘A simple undirected regular graph is said to be semisymmetric if it is edge-transitive but not vertex-transitive.For a semisymmetric graphΓof order 2p^(3),p a prime,it is well known thatΓis bipartite with two biparts having equal size.The complete classification of such graphs has been given for the full automorphism group Aut(Γ)acting unfaithfully on at least one bipart ofΓ,which shows that there is only one infinite family of such graphs with valency p^(2).The graphs of this kind have been determined when Aut(Γ)acts faithfully and primitively on at least one bipart ofΓ,and thus there is only one remaining case for classifying such graphs of valency p^(2),Aut(Γ)acting faithfully and imprimitively on both biparts ofΓ,which is dealt with in this paper.As a result,there is only one infinite family of semisymmetric graphs of order 2p^(3)with valency p^(2).
基金NSF of China (Project No.10571013)NSF of He'nan Province of China
文摘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.
