Skip to main content
×
×
Home

CUBIC EDGE-TRANSITIVE GRAPHS OF ORDER 8p2

  • MEHDI ALAEIYAN (a1) and MOHSEN GHASEMI (a2)
Abstract

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. Folkman, ‘Regular line-symmetric graphs’, J. Combin. Theory3 (1967), 215–232] that a regular edge-transitive graph of order 2p or 2p2 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 8p2 is vertex-transitive.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      CUBIC EDGE-TRANSITIVE GRAPHS OF ORDER 8p2
      Available formats
      ×
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      CUBIC EDGE-TRANSITIVE GRAPHS OF ORDER 8p2
      Available formats
      ×
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      CUBIC EDGE-TRANSITIVE GRAPHS OF ORDER 8p2
      Available formats
      ×
Copyright
Corresponding author
For correspondence; e-mail: alaeiyan@iust.ac.ir
References
Hide All
[1]Bouwer, I. Z., ‘An edge but not vertex transitive cubic graph’, Bull. Can. Math. Soc. 11 (1968), 533535.
[2]Bouwer, I. Z., ‘On edge but not vertex transitive regular graphs’, J. Combin. Theory, B 12 (1972), 3240.
[3]Conder, M., Malnic, A., Marusic, D. and Potocnik, P., ‘A census of semisymmetric cubic graphs on up to 768 vertices’, J. Algebraic Combin. 23 (2006), 255294.
[4]Du, S. F., Kwak, J. H. and Xu, M. Y., ‘Lifting of automorphisms on the elementary abelian regular covering’, Linear Algebra Appl. 373 (2003), 101119.
[5]Du, S. F. and Xu, M. Y., ‘A classification of semisymmetric graphs of order 2pq’, Comm. Algebra 28(6) (2000), 26852715.
[6]Feng, Y. Q., Kwak, J. H. and Wang, K., ‘Classifying cubic symmetric graphs of order 8p or 8p 2’, European J. Combin. 26 (2005), 10331052.
[7]Feng, Y. Q. and Wang, K., ‘s-Regular cyclic coverings of the three-dimensional hypercube Q 3’, European J. Combin. 24 (2003), 719731.
[8]Folkman, J., ‘Regular line-symmetric graphs’, J. Combin. Theory 3 (1967), 215232.
[9]Gorenstein, D., Finite simple groups (Plenum Press, New York, 1982).
[10]Gross, J. L. and Tucker, T. W., ‘Generating all graph coverings by permutation voltage assignments’, Discrete Math. 18 (1977), 273283.
[11]Iofinova, M. E. and Ivanov, A. A., Biprimitive cubic graphs, an investigation in algebraic theory of combinatorial objects (Institute for System Studies, Moscow, 1985), pp. 124134 (in Russian).
[12]Ivanov, A. V., ‘On edge but not vertex transitive regular graphs’, Comb. Annals Discrete Math. 34 (1987), 273286.
[13]Klin, M. L., ‘On edge but not vertex transitive regular graphs’, in: Algebric methods in graph theory, Colloq-Math. Soc. Janos Bolyai, 25 (North-Holland, Amsterdam, 1981), pp. 399403.
[14]Lu, Z., Wang, C. Q. and Xu, M. Y., ‘On semisymmetric cubic graphs of order 6p 2’, Sci. China Ser. A Math. 47 (2004), 1117.
[15]Malnic, A., ‘Group actions, covering and lifts of automorphisms’, Discrete Math. 182 (1998), 203218.
[16]Malnic, A., Marusic, D. and Potocnik, P., ‘On cubic graphs admitting an edge-transitive solvable group’, J. Algebraic Combin. 20 (2004), 99113.
[17]Malnic, A., Marusic, D. and Wang, C. Q., ‘Cubic edge-transitive graphs of order 2p 3’, Discrete Math. 274 (2004), 187198.
[18]Skoviera, M., ‘A construction to the theory of voltage groups’, Discrete Math. 61 (1986), 281292.
[19]Titov, V. K., ‘On symmetry in graphs’, Proc. 2nd All Union Seminar on Combinatorial Mathematics, Vopracy Kibernetiki, 9150, part 2 (Nauka, Moscow, 1975), pp. 76–109 (in Russian).
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Bulletin of the Australian Mathematical Society
  • ISSN: 0004-9727
  • EISSN: 1755-1633
  • URL: /core/journals/bulletin-of-the-australian-mathematical-society
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×
MathJax

Keywords:

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 70 *
Loading metrics...

Abstract views

Total abstract views: 88 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 13th June 2018. This data will be updated every 24 hours.