A note on another construction of graphs with 4 n + 6 vertices and cyclic automorphism group of order 4 n

Peteris Daugulis

Archivum Mathematicum (2017)

  • Volume: 053, Issue: 1, page 13-18
  • ISSN: 0044-8753

Abstract

top
The problem of finding minimal vertex number of graphs with a given automorphism group is addressed in this article for the case of cyclic groups. This problem was considered earlier by other authors. We give a construction of an undirected graph having 4 n + 6 vertices and automorphism group cyclic of order 4 n , n 1 . As a special case we get graphs with 2 k + 6 vertices and cyclic automorphism groups of order 2 k . It can revive interest in related problems.

How to cite

top

Daugulis, Peteris. "A note on another construction of graphs with $4n+6$ vertices and cyclic automorphism group of order $4n$." Archivum Mathematicum 053.1 (2017): 13-18. <http://eudml.org/doc/287953>.

@article{Daugulis2017,
abstract = {The problem of finding minimal vertex number of graphs with a given automorphism group is addressed in this article for the case of cyclic groups. This problem was considered earlier by other authors. We give a construction of an undirected graph having $4n+6$ vertices and automorphism group cyclic of order $4n$, $n\ge 1$. As a special case we get graphs with $2^k+6$ vertices and cyclic automorphism groups of order $2^k$. It can revive interest in related problems.},
author = {Daugulis, Peteris},
journal = {Archivum Mathematicum},
keywords = {graph; automorphism group},
language = {eng},
number = {1},
pages = {13-18},
publisher = {Department of Mathematics, Faculty of Science of Masaryk University, Brno},
title = {A note on another construction of graphs with $4n+6$ vertices and cyclic automorphism group of order $4n$},
url = {http://eudml.org/doc/287953},
volume = {053},
year = {2017},
}

TY - JOUR
AU - Daugulis, Peteris
TI - A note on another construction of graphs with $4n+6$ vertices and cyclic automorphism group of order $4n$
JO - Archivum Mathematicum
PY - 2017
PB - Department of Mathematics, Faculty of Science of Masaryk University, Brno
VL - 053
IS - 1
SP - 13
EP - 18
AB - The problem of finding minimal vertex number of graphs with a given automorphism group is addressed in this article for the case of cyclic groups. This problem was considered earlier by other authors. We give a construction of an undirected graph having $4n+6$ vertices and automorphism group cyclic of order $4n$, $n\ge 1$. As a special case we get graphs with $2^k+6$ vertices and cyclic automorphism groups of order $2^k$. It can revive interest in related problems.
LA - eng
KW - graph; automorphism group
UR - http://eudml.org/doc/287953
ER -

References

top
  1. Arlinghaus, W.C., The classification of minimal graphs with given abelian automorphism group, Mem. Amer. Math. Soc. 57 (1985), no. 330, viii+86 pp. (1985) Zbl0568.05031MR0803975
  2. Babai, L., 10.4153/CMB-1974-082-9, Canad. Math. Bull. 17 (1974), 467–470. (1974) Zbl0311.05120MR0406855DOI10.4153/CMB-1974-082-9
  3. Babai, L., In Graham R.L.; Grotschel M.; Lovasz L., Handbook of Combinatorics I, n Graham R.L.; Grotschel M.; Lovasz L., Handbook of Combinatorics I, ch. Automorphism groups, isomorphism, reconstruction, pp. 1447–1540, North-Holland, 1995. (1995) MR1373683
  4. Bosma, W., Cannon, J., Playoust, C., 10.1006/jsco.1996.0125, J. Symbolic Comput. 24 (1997), 235–265. (1997) Zbl0898.68039MR1484478DOI10.1006/jsco.1996.0125
  5. Bouwer, I.Z., Frucht, R., In Jagdish N. Srivastava, A survey of combinatorial the, Jagdish N. Srivastava, A survey of combinatorial the, ch. Line-minimal graphs with cyclic group, pp. 53–69, North-Holland, 1973. (1973) 
  6. Daugulis, P., 10 -vertex graphs with cyclic automorphism group of order 4 , 2014, http://arxiv.org/abs/1410.1163. 
  7. Diestel, R., Graph Theory, Graduate Texts in Mathematics, vol. 173, Springer-Verlag, Heidelberg, 2010. (2010) Zbl1209.00049
  8. Frucht, R., Herstellung von Graphen mit vorgegebener abstrakter Gruppe, Compositio Math. (in German) 6 (1939), 239–250. (1939) MR1557026
  9. Harary, F., Graph Theory, Addison-Wesley, Reading, MA, 1969. (1969) Zbl0196.27202MR0256911
  10. McKay, B.D., Piperno, A., 10.1016/j.jsc.2013.09.003, J. Symbolic Comput. 60 (2013), 94–112. (2013) MR3131381DOI10.1016/j.jsc.2013.09.003
  11. Sabidussi, G., 10.1007/BF01299094, Monatsh. Math. 63 (2) (1959), 124–127. (1959) Zbl0085.37901MR0104596DOI10.1007/BF01299094

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.