Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Preliminaries Related to Coverings
References
All Topics
Mathematics
Applied Mathematics

Cubic semisymmetric graphs of order

Profile image of Mohsen GhasemiMohsen Ghasemi

2010, Discrete Mathematics

https://doi.org/10.1016/J.DISC.2010.05.018
visibility

…

description

11 pages

link

1 file

Abstract

A regular edge-transitive graph is said to be semisymmetric if it is not vertex-transitive. By Folkman [J. Folkman, Regular line-symmetric graphs, 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. [A. Malnič, D. Marušič, C.Q. Wang, Cubic edge-transitive graphs of order 2p 3 , 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 a connected cubic semisymmetric graph of order 6p 3 exists if and only if p − 1 is divisible by 3. There are exactly two such graphs for a given order, which are constructed explicitly.

Related papers

CUBIC EDGE-TRANSITIVE GRAPHS OF ORDER 8 p2
Mohsen Ghasemi

Bulletin of The Australian Mathematical Society, 2008

A regular graph Γ is said to be semisymmetric if its full automorphism group acts transitively on its edge-set but not on its vertex-set. It was shown by Folkman [5] that a regular edge-transitive graph of order 2p or 2p 2 is necessarily vertex-transitive, where p is a prime. In this paper, it is proved that there is no connected semisymmetric cubic graph of order 4p 2 , where p is a prime.

View PDFchevron_right
ON THE CUBIC EDGE-TRANSITIVE GRAPHS OF ORDER $58p2$
Mehdi Alaeiyan

Journal of the Indonesian Mathematical Society, 2015

A graph is called edge-transitive, if its full automorphism group acts transitively on its edge set. In this paper, we inquire the existence of connected edge-transitive cubic graphs of order 58p 2 for each prime p. It is shown that only for p = 29, there exists a unique edge-transitive cubic graph of order 58p 2 .

View PDFchevron_right
Semisymmetric cubic graphs of order 16p 2
Hamid Tavallaee

Proceedings - Mathematical Sciences, 2010

An undirected graph without isolated vertices is said to be semisymmetric if its full automorphism group acts transitively on its edge set but not on its vertex set. In this paper, we inquire the existence of connected semisymmetric cubic graphs of order 16p 2 . It is shown that for every odd prime p, there exists a semisymmetric cubic graph of order 16p 2 and its structure is explicitly specified by giving the corresponding voltage rules generating the covering projections.

View PDFchevron_right
A CLASSIFICATION OF SEMISYMMETRIC CUBIC GRAPHS OF ORDER 28p&sup2
Mehdi Alaeiyan

Journal of the Indonesian Mathematical Society, 2010

A graph is said to be semisymmetric if its full automorphism group actstransitively on its edge set but not on its vertex set. In this paper, we prove thatthere is only one semisymmetric cubic graph of order 28p2, where p is a prime.DOI : http://dx.doi.org/10.22342/jims.16.2.38.139-143

View PDFchevron_right
Cubic edge-transitive graphs of order 2p3
Aleksander Malnic

Discrete Mathematics, 2004

Let p be a prime. It was shown by Folkman (J. Combin. Theory 3 (1967) 215) that a regular edge-transitive graph of order 2p or 2p 2 is necessarily vertex-transitive. In this paper an extension of his result in the case of cubic graphs is given. It is proved that, with the exception of the Gray graph on 54 vertices, every cubic edge-transitive graph of order 2p 3 is vertex-transitive.

View PDFchevron_right
A classification of cubic edge-transitive graphs of order 46p2
Mehdi Alaeiyan

Acta Universitatis Apulensis, 2014

A graph is called edge-transitive, if its automorphisms group acts transitively on the set of its edges. In this paper, we classify all connected cubic edge-transitive graphs of order 46p 2 , where p is a prime.

View PDFchevron_right
CUBIC SYMMETRIC GRAPHS OF ORDERS 36p AND 36p2
Mehdi Alaeiyan

A graph is symmetric, if its automorphism group is transitive on the set of its arcs. In this paper, we classify all the connected cubic symmetric graphs of order 36p and 36p 2 , for each prime p, of which the proof depends on the classification of finite simple groups.

View PDFchevron_right
Classifying cubic edge-transitive graphs of order 8p
Mehdi Alaeiyan

Proceedings - Mathematical Sciences, 2009

A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not vertex-transitive. Let p be a prime. It was shown by Folkman (J. Combin. Theory 3 (1967) 215-232) that a regular edge-transitive graph of order 2p or 2p 2 is necessarily vertex-transitive. In this paper, an extension of his result in the case of cubic graphs is given. It is proved that, every cubic edge-transitive graph of order 8p is symmetric, and then all such graphs are classified.

View PDFchevron_right
CUBIC SYMMETRIC GRAPHS OF ORDER 10p
Mohsen Ghasemi

2013

An automorphism group of a graph is said to be s-regular if it acts regularly on the set of s-arcs in the graph. A graph is s-regular if its full automorphism group is s-regular. In the present paper, all sregular cubic graphs of order 10p 3 are classified for each s ≥ 1 and each prime p.

View PDFchevron_right
Classifying cubic symmetric graphs of order $18 p^2$
Mehdi Alaeiyan

Armenian Journal of Mathematics

A $s$-arc in a graph is an ordered $(s+1)$-tuple $(v_{0}, v_{1}, \cdots, v_{s-1}, v_{s})$ of vertices such that $v_{i-1}$ is adjacent to $v_{i}$ for $1\leq i \leq s$ and $v_{i-1}\neq v_{i+1}$ for $1\leq i < s$. A graph $X$ is called $s$-regular if its automorphism group acts regularly on the set of its $s$-arcs. In this paper, we classify all connected cubic $s$-regular graphs of order $18p^2$ for each $s\geq1$ and each prime $p$.

View PDFchevron_right

References (34)

  1. N. Biggs, Three remarkable graphs, Canad. J. Math. 25 (1973) 397-411.
  2. I.Z. Bouwer, An edge but not vertex transitive cubic graph, Bull. Canad. Math. Soc. 11 (1968) 533-535.
  3. I.Z. Bouwer, On edge but not vertex transitive regular graphs, J. Combin. Theory B 12 (1972) 32-40.
  4. M. Conder, P. Dobcsanyi, Trivalent symmetric graphs on up to 768 vertices, J. Combin. Math. Combin. Comput. 40 (2002) 41-63.
  5. M. Conder, A. Malnič, D. Marušič, P. Potočnik, A census of semisymmetric cubic graphs on up to 768 vertices, J. Algebraic Combin. 23 (2006) 255-294.
  6. J.H. Conway, R.T. Curtis, S.P. Norton, R.A. Parker, R.A. Wilson, Atlas of Finite Group, Clarendon Press, Oxford, 1985.
  7. S.F. Du, M.Y. Xu, A classification of semisymmetric graphs of order 2pq, Comm. in Algebra 28 (2000) 2685-2715.
  8. Y.-Q. Feng, J.H. Kwak, M.Y. Xu, Cubic s-regular graphs of order 2p 3 , J. Graph Theory 52 (2006) 341-352.
  9. Y.Q. Feng, J.H. Kwak, Cubic symmetric graphs of order a small number times a prime or a prime square, J. Combin. Theory B 94 (2007) 627-646.
  10. Y.-Q. Feng, J.X. Zhou, A note on semisymmetric graphs, Discrete Math. 308 (2008) 4031-4035.
  11. J. Folkman, Regular line-symmetric graphs, J. Combin Theory 3 (1967) 215-232.
  12. D. Gorenstein, Finite Simple Groups, Plenum Press, New York, 1982.
  13. J.L. Gross, T.W. Tucker, Generating all graph covering by permutation voltages assignment, Discrete Math. 18 (1977) 273-283.
  14. M.E. Iofinova, A.A. Ivanov, Biprimitive cubic graphs, in: Investigation in Algebraic Theory of Combinatorial Objects, Institute for System Studies, Moscow, 1985, pp. 124-134 (in Russian).
  15. A.V. Ivanov, On edge but not vertex transitive regular graphs, Ann. Discrete Math. 34 (1987) 273-286.
  16. M.L. Klin, On edge but not vertex transitive regular graphs, Colloq-Math. Soc. Janos Bolyai, 25, Algebraic Methods in Graph Theory, Szeged (Hungary), Budapest, 1981, pp. 399-403.
  17. F. Lazebnik, R. Viglione, An infinite series of regular edge-but not vertex-transitive graphs, J. Graph Theory 41 (2002) 249-258.
  18. Z. Lu, C.Q. Wang, M.Y. Xu, On semisymmetric cubic graphs of order 6p 2 , Sc. in China A 47 (2004) 11-17.
  19. A. Malnič, Group actions, covering and lifts of automorphisms, Discrete Math. 182 (1998) 203-218.
  20. A. Malnič, D. Marušič, S. Miklavič, P. Potočnik, Semisymmetric elementary abelian covers of the Möbius-Kantor graph, Discrete Math. 307 (2007) 2156-2175.
  21. A. Malnič, D. Marušič, P. Potočnik, Elementary abelian covers of graphs, J. Algebr. Combin. 20 (2004) 71-97.
  22. A. Malnič, D. Marušič, P. Potočnik, On cubic graphs admitting an edge-transitive solvable group, J. Algebr. Combin. 20 (2004) 99-113.
  23. A. Malnič, D. Marušič, P. Potočnik, C.Q. Wang, An infinite family of cubic edge-but not vertex-transitive graphs, Discrete Math. 280 (2004) 133-148.
  24. A. Malnič, D. Marušič, C.Q. Wang, Cubic edge-transitive graphs of order 2p 3 , Discrete Math. 274 (2004) 187-198.
  25. D. Marušič, Constructing cubic edge-but not vertex-transitive graphs, J. Graph Theory 35 (2000) 152-160.
  26. D. Marušič, P. Potočnik, Semisymmetry of generalized Folkman graphs, Eur. J. Combin. 22 (2001) 333-349.
  27. C.W. Parker, Semisymmetric cubic graphs of twice odd order, Eur. J. Combin. 28 (2007) 572-591.
  28. D.J. Robinson, A Course in the Theory of Groups, Springer-Verlag, New York, 1982.
  29. M. Škoviera, A construction to the theory of voltage groups, Discrete Math. 61 (1986) 281-292.
  30. V.K. Titov, On symmetry in graphs, Voprocy Kibernetiki 9150, in: Proc. of II all Union Seminar on Combinatorial Mathematics, part 2, Nauka, Moscow, 1975, pp. 76-109 (in Russian).
  31. W.T. Tutte, A family of cubical graphs, Proc. Cambr. Philos. Soc. 43 (1947) 459-474.
  32. W.T. Tutte, On the symmetry of cubic graphs, Canad. J. Math. 11 (1959) 621-624.
  33. S. Wilson, A worthy family of semisymmetric graphs, Discrete Math. 271 (2003) 283-294.
  34. M.Y. Xu, Half-transitive graphs of prime-cube order, J. Algebraic Combin. 1 (1992) 275-282.

Related papers

Semisymmetric cubic graphs of orders 36p, 36p2
Mehdi Alaeiyan

Filomat, 2013

A cubic graph is said to be semisymmetric if its full automorphism group acts transitively on its edge set but not on its vertex set. The semisymmetric cubic graphs of orders 6p and 6p 2 were classified in (Com. in Algebra, 28 (6) (2000) 2685-2715) and (Science in China Ser. A Mathematics, 47 (2004) No.1 1-17), respectively. In this paper we first classify all connected cubic semisymmetric graphs of order 36p for each prime p and also classify all connected cubic semisymmetric graphs of order 36p 2 , where p 5 and 7 is a prime.

View PDFchevron_right
Semisymmetric Cubic Graphs of Order 4p
Mehdi Alaeiyan

2009

An regular graph is said to be semisymmetric if its full automorphism group acts transitively on its edge set but not on its vertex set. In this paper we prove that for every prime p(6= 5), there is no semisymmetric cubic graph of order 4pn, where n ≥ 1. 2000 Mathematics Subject Classification: 05C25, 20B25.

View PDFchevron_right
A CLASSIFICATION OF THE CUBIC SEMISYMMETRIC GRAPHS OF ORDER 34<em>p&sup2;</em>
Mehdi Alaeiyan

Journal of the Indonesian Mathematical Society, 2012

A simple undirected graph is called semisymmetric if it is regular and edge transitive but not vertex-transitive. In this paper, we classify all connected cubic semisymmetric graph of order 34p², where p be a prime.DOI : http://dx.doi.org/10.22342/jims.17.1.9.11-15

View PDFchevron_right
CUBIC EDGE-TRANSITIVE GRAPHS OF ORDER 8<i>p</i><sup>2</sup>
Mehdi Alaeiyan

Bulletin of The Australian Mathematical Society, 2008

A regular graph Γ is said to be semisymmetric if its full automorphism group acts transitively on its edge-set but not on its vertex-set. It was shown by Folkman [5] that a regular edge-transitive graph of order 2p or 2p 2 is necessarily vertex-transitive, where p is a prime. In this paper, it is proved that there is no connected semisymmetric cubic graph of order 4p 2 , where p is a prime.

View PDFchevron_right
Cubic edge-transitive graphs of order 4p2
Mehdi Alaeiyan

A regular graph Γ is said to be semisymmetric if its full automorphism group acts transitively on its edge-set but not on its vertex-set. It was shown by Folkman [5] that a regular edgetransitive graph of order 2p or 2p 2 is necessarily vertex-transitive, where p is a prime. In this paper, it is proved that there is no connected semisymmetric cubic graph of order 4p 2 , where p is a prime.

View PDFchevron_right

Related topics

  • Applied Mathematics
  • Pure Mathematics
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved