Ádám, A. 1967. Research problem 2–10. J. Combin. Theory, 2, 393.Google Scholar

Ahrens, W. 1901. Mathematische Unterhaltungen und Spiele. Teubner, Leipzig.Google Scholar

Alperin, J. L., and Bell, Rowen B. 1995. Groups and Representations. Graduate Texts in Mathematics, vol. 162. Springer-Verlag, New York.Google Scholar

Alspach, Brian. 1973. Point-symmetric graphs and digraphs of prime order and transitive permutation groups of prime degree. J. Combin. Theory Ser. B, 15, 12–17.CrossRefGoogle Scholar

Alspach, Brian. 1979. Hamiltonian cycles in vertex-transitive graphs of order 2p. Pages 131–139 of: Proceedings of the Tenth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, FL, 1979). Congress. Numer., XXIII–XX. Utilitas Math., Winnipeg, MB.Google Scholar

Alspach, Brian. 1983. The classification of Hamiltonian generalized Petersen graphs. J. Combin. Theory Ser. B, 34(3), 293–312.CrossRefGoogle Scholar

Alspach, Brian. 1989. Lifting Hamilton cycles of quotient graphs. Discrete Math., 78(1–2), 25–36.CrossRefGoogle Scholar

Alspach, Brian. 2013. Johnson graphs are Hamilton-connected. Ars Math. Contemp., 6(1), 21–23.CrossRefGoogle Scholar

Alspach, Brian, and Dobson, Edward. 2015. On automorphism groups of graph truncations. Ars Math. Contemp., 8(1), 215–223.Google Scholar

Alspach, Brian, and Mishna, Marni. 2002. Enumeration of Cayley graphs and digraphs. Discrete Math., 256(3), 527–539.Google Scholar

Alspach, Brian, and Parsons, T. D. 1979. Isomorphism of circulant graphs and digraphs. Discrete Math., 25(2), 97–108.Google Scholar

Alspach, Brian, and Parsons, T. D. 1982a. A construction for vertex-transitive graphs. Canad. J. Math., 34(2), 307–318.Google Scholar

Alspach, Brian, and Parsons, T. D. 1982b. On Hamiltonian cycles in metacirculant graphs. Pages 1–7 of: Algebraic and Geometric Combinatorics. North-Holland Math. Stud., vol. 65. North-Holland, Amsterdam.Google Scholar

Alspach, Brian, and Qin, Yusheng. 2001. Hamilton-connected Cayley graphs on Hamiltonian groups. European J. Combin., 22(6), 777–787.CrossRefGoogle Scholar

Alspach, Brian, and Xu, Ming Yao. 1994. 1/2-transitive graphs of order 3p. J. Algebraic Combin., 3(4), 347–355.CrossRefGoogle Scholar

Alspach, B., and Zhang, Cun Quan. 1989. Hamilton cycles in cubic Cayley graphs on dihedral groups. Ars Combin., 28, 101–108.Google Scholar

Alspach, Brian, Durnberger, Erich, and Parsons, T. D. 1985. Hamilton cycles in metacirculant graphs with prime cardinality blocks. Pages 27–34 of: Cycles in Graphs (Burnaby, B.C., 1982). North-Holland Math. Stud., vol. 115. North-Holland, Amsterdam.Google Scholar

Alspach, Brian, Locke, Stephen C., and Witte, Dave. 1990. The Hamilton spaces of Cayley graphs on abelian groups. Discrete Math., 82(2), 113–126.Google Scholar

Alspach, Brian, Marušič, Dragan, and Nowitz, Lewis. 1994. Constructing graphs which are 1/2-transitive. J. Austral. Math. Soc. Ser. A, 56(3), 391–402.Google Scholar

Alspach, Brian, Conder, Marston D. E., Marušič, Dragan, and Xu, Ming-Yao. 1996. A classification of 2-arc-transitive circulants. J. Algebraic Combin., 5(2), 83–86.CrossRefGoogle Scholar

Alspach, Brian, Morris, Joy, and Vilfred, V. 1999. Self-complementary circulant graphs. Ars Combin., 53, 187–191.Google Scholar

Alspach, Brian, Chen, C. C., and Dean, Matthew. 2010. Hamilton paths in Cayley graphs on generalized dihedral groups. Ars Math. Contemp., 3(1), 29–47.Google Scholar

André, Jorge, Araújo, João, and Cameron, Peter J. 2016. The classification of partition homogeneous groups with applications to semigroup theory. J. Algebra, 452, 288–310.CrossRefGoogle Scholar

Antončič, Iva, Hujdurović, Ademir, and Kutnar, Klavdija. 2015. A classification of pentavalent arc-transitive bicirculants. J. Algebraic Combin., 41(3), 643–668.CrossRefGoogle Scholar

Arezoomand, Majid, and Ghasemi, Mohsen. 2021. On 2-closed elusive permutation groups of degrees p²q and p²qr. Communications in Algebra, 49(2), 614–620.Google Scholar

Artin, E. 1988. Geometric Algebra. Wiley Classics Library. John Wiley & Sons, Inc., New York. Reprint of the 1957 original, A Wiley-Interscience Publication.CrossRefGoogle Scholar

Aschbacher, M. 1984. On the maximal subgroups of the finite classical groups. Invent. Math., 76(3), 469–514.Google Scholar

Babai, L. 1977. Isomorphism problem for a class of point-symmetric structures. Acta Math. Acad. Sci. Hungar., 29(3–4), 329–336.CrossRefGoogle Scholar

Babai, L. 1978. Infinite digraphs with given regular automorphism groups. J. Combin. Theory Ser. B, 25(1), 26–46.Google Scholar

Babai, László. 1979. Long cycles in vertex-transitive graphs. J. Graph Theory, 3(3), 301–304.CrossRefGoogle Scholar

Babai, L. 1980. Finite digraphs with given regular automorphism groups. Period. Math. Hungar., 11(4), 257–270.CrossRefGoogle Scholar

Babai, László. 1995. Automorphism groups, isomorphism, reconstruction. Pages 1447–1540 of: Handbook of Combinatorics, vol. 1, 2. Elsevier, Amsterdam.Google Scholar

Babai, László. 2015. Graph Isomorphism in Quasipolynomial Time. CoRR, arXiv: abs/1512.03547.Google Scholar

Babai, László. 2016. Graph isomorphism in quasipolynomial time [extended abstract]. Pages 684–697 of: STOC’16 – Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing. ACM, New York.Google Scholar

Babai, L., and Frankl, P. 1978. Isomorphisms of Cayley graphs. I. Pages 35–52 of: Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. I. Colloq. Math. Soc. János Bolyai, vol. 18. North-Holland, Amsterdam.Google Scholar

Babai, L., and Frankl, P. 1979. Isomorphisms of Cayley graphs. II. Acta Math. Acad. Sci. Hungar., 34(1–2), 177–183.Google Scholar

Babai, László, and Godsil, Chris D. 1982. On the automorphism groups of almost all Cayley graphs. European J. Combin., 3(1), 9–15.Google Scholar

Baik, Young-Gheel, Feng, Yanquan, Sim, Hyo-Seob, and Xu, Mingyao. 1998. On the normality of Cayley graphs of abelian groups. Algebra Colloq., 5(3), 297–304.Google Scholar

Baik, Young-Gheel, Feng, Yanquan, and Sim, Hyo-Seob. 2000. The normality of Cayley graphs of finite abelian groups with valency 5. Systems Sci. Math. Sci., 13(4), 425–431.Google Scholar

Balaban, A. T. 1972. Chemical graphs, part XIII; Combinatorial patterns. Rev. Roumaine Math. Pures Appl., 17, 3–16.Google Scholar

Bamberg, John, and Giudici, Michael. 2011. Point regular groups of automorphisms of generalised quadrangles. J. Combin. Theory Ser. A, 118(3), 1114–1128.Google Scholar

Barber, Rachel, and Dobson, Ted. 2022. Recognizing vertex-transitive digraphs which are wreath products, double coset digraphs, and generalized wreath products. Preprint.Google Scholar

Bays, S. 1930. Sur les systèmes cycliques de triples de Steiner différents pour N premier (ou puissance de nombre premier) de la forme 6 n+1. Comment. Math. Helv., 2(1), 294–306.Google Scholar

Bays, S. 1931. Sur les systèmes cycliques de triples de Steiner différents pour N premier de la forme 6 n + 1. Comment. Math. Helv., 3, 22–41, 122–147, 307–325.Google Scholar

Beaumont, R. A., and Peterson, R. P. 1955. Set-transitive permutation groups. Canad. J. Math., 7, 35–42.Google Scholar

Bermond, J.-C. 1978a. Hamiltonian decompositions of graphs, directed graphs and hypergraphs. Ann. Discrete Math., 3, 21–28. In Advances in Graph Theory (Cambridge Combinatorial Conf., Trinity College, Cambridge, 1977).Google Scholar

Bermond, J.-C. 1978b. Hamiltonian graphs. Pages 127–167 of: Beinke, L.W., Wilson, R.J. (ed), Selected Topics in Graph Theory. Academic Press, London.Google Scholar

Bhoumik, Soumya, Dobson, Edward, and Morris, Joy. 2014. On the automorphism groups of almost all circulant graphs and digraphs. Ars Math. Contemp., 7(2), 487–506.Google Scholar

Biggs, Norman. 1973. Three remarkable graphs. Canad. J. Math., 25, 397–411.CrossRefGoogle Scholar

Biggs, Norman. 1979. Some odd graph theory. Pages 71–81 of: Second International Conference on Combinatorial Mathematics (New York, 1978). Ann. New York Acad. Sci., vol. 319. New York Acad. Sci., New York.Google Scholar

Biggs, N. L. 1981. Aspects of symmetry in graphs. Pages 27–35 of: Algebraic Methods in Graph Theory, Vol. I, II (Szeged, 1978). Colloq. Math. Soc. János Bolyai, vol. 25. North-Holland, Amsterdam-New York.Google Scholar

Biggs, N. L., and Smith, D. H. 1971. On trivalent graphs. Bull. London Math. Soc., 3, 155–158.Google Scholar

Boben, Marko, Pisanski, Tomaž, and Žitnik, Arjana. 2005. I-graphs and the corresponding configurations. J. Combin. Des., 13(6), 406–424.Google Scholar

Bollobás, Béla. 1998. Modern Graph Theory. Graduate Texts in Mathematics, vol. 184. Springer-Verlag, New York.Google Scholar

Bondy, J. A. 1972. Variations on the Hamiltonian theme. Canad. Math. Bull., 15, 57–62.CrossRefGoogle Scholar

Bonnington, C. Paul, Conder, Marston, Morton, Margaret, and McKenna, Patricia. 2002. Embedding digraphs on orientable surfaces. J. Combin. Theory Ser. B, 85(1), 1–20.Google Scholar

Boreham, T. G., Bouwer, I. Z., and Frucht, R. W. 1974. A useful family of bicubic graphs. Pages 213–225. Lecture Notes in Math., Vol. 406 of: Graphs and Combinatorics (Proc. Capital Conf., George Washington Univ., Washington, D.C., 1973). Berlin: Springer.Google Scholar

Bosma, Wieb, Cannon, John, and Playoust, Catherine. 1997. The Magma algebra system. I. The user language. J. Symbolic Comput., 24(3–4), 235–265. Computational algebra and number theory (London, 1993).Google Scholar

Bouwer, I. Z. 1968. An edge but not vertex transitive cubic graph. Canad. Math. Bull., 11, 533–535.Google Scholar

Bouwer, I. Z. 1970. Vertex and edge transitive, but not 1-transitive, graphs. Canad. Math. Bull., 13, 231–237.Google Scholar

Bouwer, I. Z. 1972. On edge but not vertex transitive regular graphs. J. Combin. Theory Ser. B, 12, 32–40.Google Scholar

Brand, Neal. 1989. On the Bays–Lambossy theorem. Discrete Math., 78(3), 217–222.Google Scholar

Breckman, J. 1956. Encoding Circuit. US Patent 2733432. Issued Jan 31, 1956.Google Scholar

Brouwer, A. E., Cohen, A. M., and Neumaier, A. 1989. Distance-Regular Graphs. Ergebnisse der Mathematik und ihrer Grenzgebiete (3) [Results in Mathematics and Related Areas (3)], vol. 18. Springer-Verlag, Berlin.CrossRefGoogle Scholar

Burnside, W. 1897. Theory of Groups of Finite Order. Cambridge University Press.Google Scholar

Burnside, W. 1901. On some properties of groups of odd order. J. London Math. Soc., 33, 162–185.Google Scholar

Burton, David M. 2010. Elementary Number Theory. Seventh ed. McGraw-Hill, New York.Google Scholar

Cameron, Peter J. 1981. Finite permutation groups and finite simple groups. Bull. London Math. Soc., 13(1), 1–22.Google Scholar

Cameron, P. J. (ed). 1997. Problems from the fifteenth British combinatorial conference. Discrete Math., 167/168, 605–615.Google Scholar

Cameron, Peter J., Giudici, Michael, Jones, Gareth A., et al. 2002. Transitive permutation groups without semiregular subgroups. J. London Math. Soc. (2), 66(2), 325–333.Google Scholar

Cara, Philippe, Rottey, Sara, and Van de Voorde, Geertrui. 2014. A construction for infinite families of semisymmetric graphs revealing their full automorphism group. J. Algebraic Combin., 39(4), 967–988.Google Scholar

Castagna, Frank, and Prins, Geert. 1972. Every generalized Petersen graph has a Tait coloring. Pacific J. Math., 40, 53–58.Google Scholar

Chao, Chong-yun. 1965. On groups and graphs. Trans. Amer. Math. Soc., 118, 488–497.Google Scholar

Chao, Chong-yun. 1971. On the classification of symmetric graphs with a prime number of vertices. Trans. Amer. Math. Soc., 158, 247–256.Google Scholar

Chen, C. C., and Quimpo, N. F. 1981. On strongly Hamiltonian abelian group graphs. Pages 23–34 of: Combinatorial Mathematics, VIII (Geelong, 1980). Lecture Notes in Math., vol. 884. Springer, Berlin.Google Scholar

Chen, C. C., and Quimpo, N. 1983. Hamiltonian Cayley graphs of order pq. Pages 1–5 of: Combinatorial Mathematics, X (Adelaide, 1982). Lecture Notes in Math., vol. 1036. Springer, Berlin.Google Scholar

Chen, Ya-Chen. 2003. Triangle-free Hamiltonian Kneser graphs. J. Combin. Theory Ser. B, 89(1), 1–16.CrossRefGoogle Scholar

Chen, Yu Qing. 1998. On Hamiltonicity of vertex-transitive graphs and digraphs of order p⁴. J. Combin. Theory Ser. B, 72(1), 110–121.Google Scholar

Chvátal, V. 1972. On Hamilton’s ideals. J. Combin. Theory Ser. B, 12, 163–168.Google Scholar

Conder, Marston. 2006. Trivalent (Cubic) Symmetric Graphs on up to 2048 Vertices. www.math.auckland.ac.nz/conder/symmcubic2048list.txt.Google Scholar

Conder, Marston. 2011. Trivalent Symmetric Graphs on up to 10000 Vertices. www.math.auckland.ac.nz/conder/symmcubic10000list.txt.Google Scholar

Conder, Marston, and Dobcsányi, Peter. 2002. Trivalent symmetric graphs on up to 768 vertices. J. Combin. Math. Combin. Comput., 40, 41–63.Google Scholar

Conder, Marston D. E., and Marušič, Dragan. 2003. A tetravalent half-arc-transitive graph with non-abelian vertex stabilizer. J. Combin. Theory Ser. B, 88(1), 67–76.Google Scholar

Conder, Marston, and Morton, Margaret. 1995. Classification of trivalent symmetric graphs of small order. Australas. J. Combin., 11, 139–149.Google Scholar

Conder, Marston, and Nedela, Roman. 2007. Symmetric cubic graphs of small girth. J. Combin. Theory Ser. B, 97(5), 757–768.Google Scholar

Conder, Marston, and Nedela, Roman. 2009. A refined classification of symmetric cubic graphs. J. Algebra, 322(3), 722–740.Google Scholar

Conder, Marston D. E., and Žitnik, Arjana. 2016. Half-arc-transitive graphs of arbitrary even valency greater than 2. European J. Combin., 54, 177–186.Google Scholar

Conder, Marston D., Li, Cai Heng, and Praeger, Cheryl E. 2000. On the Weiss conjecture for finite locally primitive graphs. Proc. Edinburgh Math. Soc. (2), 43(1), 129–138.Google Scholar

Conder, Marston, Malnič, Aleksander, Marušič, Dragan, and Potočnik, Primož. 2006. A census of semisymmetric cubic graphs on up to 768 vertices. J. Algebraic Combin., 23(3), 255–294.Google Scholar

Conder, Marston D. E., Potočnik, Primož, and Šparl, Primož. 2015. Some recent discoveries about half-arc-transitive graphs. Ars Math. Contemp., 8(1), 149–162.CrossRefGoogle Scholar

Conder, Marston D. E., Estélyi, István, and Pisanski, Tomaž. 2018. Vertex-transitive Haar graphs that are not Cayley graphs. Pages 61–70 of: Discrete Geometry and Symmetry. Springer Proc. Math. Stat., vol. 234. Springer, Cham.Google Scholar

Conder, Marston, Zhou, Jin-Xin, Feng, Yan-Quan, and Zhang, Mi-Mi. 2020a. Edgetransitive bi-Cayley graphs. J. Combin. Theory Ser. B, 145, 264–306.Google Scholar

Conder, Marston D. E., Hujdurović, A., Kutnar, K., and Marušič, D. 2020b. Symmetric Cubic Graphs Via Rigid Cells. https://doi.org/10.1007/s10801-020-00946-3.Google Scholar

Conway, J. H. 1971. More About Symmetrical Graphs. Talk given at the Second British Combinatorial Conference at Royal Holloway College.Google Scholar

Conway, J. H., Curtis, R. T., Norton, S. P., Parker, R. A., and Wilson, R. A. 1985. Atlas of Finite Groups. Oxford University Press, Eynsham. Maximal subgroups and ordinary characters for simple groups, With computational assistance from J. G. Thackray.Google Scholar

Conway, J. H., Sloane, N. J. A., and Wilks, Allan R. 1989. Gray codes for reflection groups. Graphs Combin., 5(4), 315–325.Google Scholar

Coxeter, H. S. M. 1950. Self-dual configurations and regular graphs. Bull. Amer. Math. Soc., 56, 413–455.Google Scholar

Coxeter, H. S. M. 1983. My graph. Proc. London Math. Soc. (3), 46(1), 117–136.Google Scholar

Coxeter, H. S. M. 1986. The generalized Petersen graph G(24, 5). Comput. Math. Appl. Part B, 12(3–4), 579–583. Symmetry: unifying human understanding, II.Google Scholar

Coxeter, H. S. M., and Moser, W. O. J. 1965. Generators and Relations for Discrete Groups. Second ed. Ergebnisse der Mathematik und ihrer Grenzgebiete, Neue Folge, Band 14. Springer-Verlag, Berlin.Google Scholar

Cuaresma, Maria Cristeta, Giudici, Michael, and Praeger, Cheryl E. 2008. Homogeneous factorisations of Johnson graphs. Des. Codes Cryptogr., 46(3), 303–327.Google Scholar

Curran, Stephen J., and Gallian, Joseph A. 1996. Hamiltonian cycles and paths in Cayley graphs and digraphs – a survey. Discrete Math., 156(1–3), 1–18.Google Scholar

Curran, Stephen J., Morris, Dave Witte, and Morris, Joy. 2012. Cayley graphs of order 16p are Hamiltonian. Ars Math. Contemp., 5(2), 185–211.Google Scholar

Dieudonné, Jean. 1980. On the Automorphisms of the Classical Groups. Memoirs of the American Mathematical Society, vol. 2. American Mathematical Society, Providence, RI. With a supplement by Loo Keng Hua [Luo Geng Hua], Reprint of the 1951 original.Google Scholar

Dixon, John D., and Mortimer, Brian. 1996. Permutation Groups. Graduate Texts in Mathematics, vol. 163. Springer-Verlag, New York.Google Scholar

Djoković, Dragomir Ž., and Miller, Gary L. 1980. Regular groups of automorphisms of cubic graphs. J. Combin. Theory Ser. B, 29(2), 195–230.Google Scholar

Dobson, Edward. 1998. Isomorphism problem for metacirculant graphs of order a product of distinct primes. Canad. J. Math., 50(6), 1176–1188.Google Scholar

Dobson, Edward. 2000. Classification of vertex-transitive graphs of order a prime cubed. I. Discrete Math., 224(1–3), 99–106.Google Scholar

Dobson, Edward. 2002. On the Cayley isomorphism problem. Discrete Math., 247(1–3), 107–116.Google Scholar

Dobson, Edward. 2003a. On isomorphisms of abelian Cayley objects of certain orders. Discrete Math., 266(1–3), 203–215. The 18th British Combinatorial Conference (Brighton, 2001).Google Scholar

Dobson, Edward. 2003b. On the Cayley isomorphism problem for ternary relational structures. J. Combin. Theory Ser. A, 101(2), 225–248.Google Scholar

Dobson, Edward. 2005. On groups of odd prime-power degree that contain a full cycle. Discrete Math., 299(1–3), 65–78.Google Scholar

Dobson, Edward. 2006a. Automorphism groups of metacirculant graphs of order a product of two distinct primes. Combin. Probab. Comput., 15(1–2), 105–130.CrossRefGoogle Scholar

Dobson, Edward. 2006b. On the proof of a theorem of Pálfy. Electron. J. Combin., 13(1), Note 16, 4 pp. (electronic).Google Scholar

Dobson, Edward. 2008. On solvable groups and Cayley graphs. J. Combin. Theory Ser. B, 98(6), 1193–1214.Google Scholar

Dobson, Edward. 2009. On overgroups of regular abelian p-groups. Ars Math. Contemp., 2(1), 59–76.Google Scholar

Dobson, Edward. 2010. The isomorphism problem for Cayley ternary relational structures for some abelian groups of order 8p. Discrete Math., 310(21), 2895–2909.Google Scholar

Dobson, Edward. 2012. The full automorphism group of Cayley graphs of . Electron. J. Combin., 19(1), Paper 57, 17.Google Scholar

Dobson, Edward. 2014. On the Cayley isomorphism problem for Cayley objects of nilpotent groups of some orders. Electron. J. Combin., 21(3), Paper 3.8, 15.Google Scholar

Dobson, Ted. 2016. On isomorphisms of Marušič-Scapellato graphs. Graphs Combin., 32(3), 913–921.Google Scholar

Dobson, Ted. 2018. On the isomorphism problem for Cayley graphs of abelian groups whose Sylow subgroups are elementary abelian cyclic. Electron. J. Combin., 25(2), Paper No. 2.49, 22.Google Scholar

Dobson, Edward, and Kovács, István. 2009. Automorphism groups of Cayley digraphs of . Electron. J. Combin., 16(1), Research Paper 149, 20.Google Scholar

Dobson, Edward, and Malnič, Aleksander. 2015. Groups that are transitive on all partitions of a given shape. J. Algebraic Combin., 42(2), 605–617.Google Scholar

Dobson, Edward, and Marušič, Dragan. 2011. On semiregular elements of solvable groups. Comm. Algebra, 39(4), 1413–1426.CrossRefGoogle Scholar

Dobson, Edward, and Morris, Joy. 2005. On automorphism groups of circulant digraphs of square-free order. Discrete Math., 299(1–3), 79–98.Google Scholar

Dobson, Edward, and Morris, Joy. 2009. Automorphism groups of wreath product digraphs. Electron. J. Combin., 16(1), Research Paper 17, 30.Google Scholar

Dobson, Edward, and Morris, Joy. 2015. Quotients of CI-groups are CI-groups. Graphs Combin., 31(3), 547–550.Google Scholar

Dobson, Edward, and Šajna, Mateja. 2004. Almost self-complementary circulant graphs. Discrete Math., 278(1–3), 23–44.Google Scholar

Dobson, Edward, and Spiga, Pablo. 2013. CI-groups with respect to ternary relational structures: new examples. Ars Math. Contemp., 6(2), 351–364.Google Scholar

Dobson, Ted, and Spiga, Pablo. 2017. Cayley numbers with arbitrarily many distinct prime factors. J. Combin. Theory Ser. B, 122, 301–310.Google Scholar

Dobson, Edward, and Witte, Dave. 2002. Transitive permutation groups of prime-squared degree. J. Algebraic Combin., 16(1), 43–69.Google Scholar

Dobson, Edward, Gavlas, Heather, Morris, Joy, and Witte, Dave. 1998. Automorphism groups with cyclic commutator subgroup and Hamilton cycles. Discrete Math., 189(1–3), 69–78.Google Scholar

Dobson, Edward, Malnič, Aleksander, Marušič, Dragan, and Nowitz, Lewis A. 2007. Minimal normal subgroups of transitive permutation groups of square-free degree. Discrete Math., 307(3–5), 373–385.Google Scholar

Dobson, Edward, Li, Cai Heng, and Spiga, Pablo. 2012. Permutation groups containing a regular abelian Hall subgroup. Comm. Algebra, 40(9), 3532–3539.Google Scholar

Dobson, Edward, Spiga, Pablo, and Verret, Gabriel. 2016. Cayley graphs on abelian groups. Combinatorica, 36(4), 371–393.Google Scholar

Dobson, Ted, Hujdurović, Ademir, Kutnar, Klavdija, and Morris, Joy. 2020a. Classification of Vertex-Transitive Digraphs Via Automorphism Group. arXiv:2003.07894[math.CO].Google Scholar

Dobson, Ted, Muzychuk, Mikhail, and Spiga, Pablo. 2020b. Generalised Dihedral CI-Groups. arXiv:2008.00200[math.CO].Google Scholar

Doyle, John Kevin, Tucker, Thomas W., and Watkins, Mark E. 2018. Graphical Frobenius representations. J. Algebraic Combin., 48(3), 405–428.Google Scholar

Doyle, P. G. 1976. On Transitive Graphs. Senior Thesis, Harvard College.Google Scholar

Du, Shaofei, and Marušič, Dragan. 1999. An infinite family of biprimitive semisymmetric graphs. J. Graph Theory, 32(3), 217–228.Google Scholar

Du, Shaofei, and Wang, Li. 2015. A classification of semisymmetric graphs of order 2p3: unfaithful case. J. Algebraic Combin., 41(2), 275–302.Google Scholar

Du, Shaofei, and Xu, Mingyao. 2000. A classification of semisymmetric graphs of order 2pq. Comm. Algebra, 28(6), 2685–2715.Google Scholar

Du, Shaofei, Malnič, Aleksander, and Marušič, Dragan. 2008. Classification of 2-arctransitive dihedrants. J. Combin. Theory Ser. B, 98(6), 1349–1372.Google Scholar

Du, Shaofei, Kutnar, Klavdija, and Marušič, Dragan. 2018. Hamilton cycles in vertex-transitive graphs of order a product of two primes, arXiv:1808.08553.Google Scholar

Du, Shaofei, Kutnar, Klavdija, and Marušič, Dragan. 2020. Hamilton cycles in primitive vertex-transitive graphs of order a product of two primes – the case PSL(2, q²) acting on cosets of PGL(2, q). Ars Math. Contemp., 19(1), 1–15.Google Scholar

Dummit, D.S., and Foote, R.M. 1999. Abstract Algebra. Prentice Hall, Upper Saddle River, NJ.Google Scholar

Dummit, David S., and Foote, Richard M. 2004. Abstract Algebra. Third ed. John Wiley & Sons, Inc., Hoboken, NJ.Google Scholar

Durnberger, Erich. 1983. Connected Cayley graphs of semidirect products of cyclic groups of prime order by abelian groups are Hamiltonian. Discrete Math., 46(1), 55–68.Google Scholar

Eiben, Eduard, Jajcay, Robert, and Šparl, Primož. 2019. Symmetry properties of generalized graph truncations. J. Combin. Theory Ser. B, 137, 291–315.Google Scholar

Elspas, Bernard, and Turner, James. 1970. Graphs with circulant adjacency matrices. J. Combin. Theory, 9, 297–307.Google Scholar

Erdős, P., and Rényi, A. 1963. Asymmetric graphs. Acta Math. Acad. Sci. Hungar., 14, 295–315.Google Scholar

Erdős, P., Ko, Chao, and Rado, R. 1961. Intersection theorems for systems of finite sets. Quart. J. Math. Oxford Ser. (2), 12, 313–320.Google Scholar

Estélyi, István, and Pisanski, Tomaž. 2016. Which Haar graphs are Cayley graphs? Electron. J. Combin., 23(3), Paper 3.10, 13.Google Scholar

Euler, Leonard. 1766. Solution d’une Question Curieuse Qui ne Paroit Soumise a Aucune Analyse. Euler Archive – All Works. https://scholarlycommons.pacific.edu/euler-works/309.Google Scholar

Evdokimov, S. A., and Ponomarenko, I. N. 2002. Characterization of cyclotomic schemes and normal Schur rings over a cyclic group. Algebra i Analiz, 14(2), 11–55.Google Scholar

Fawcett, Joanna B., Giudici, Michael, Li, Cai Heng, Praeger, Cheryl E., Royle, Gordon, and Verret, Gabriel. 2018. Primitive permutation groups with a suborbit of length 5 and vertex-primitive graphs of valency 5. J. Combin. Theory Ser. A, 157, 247–266.Google Scholar

Fein, Burton, Kantor, William M., and Schacher, Murray. 1981. Relative Brauer groups. II. J. Reine Angew. Math., 328, 39–57.Google Scholar

Feng, Y.-Q., and Kovács, I. 2018. Elementary abelian groups of rank 5 are DCI-groups. J. Combin. Theory Ser. A, 157(5), 162–204.CrossRefGoogle Scholar

Feng, Yan-Quan, and Kwak, Jin Ho. 2007. Cubic symmetric graphs of order a small number times a prime or a prime square. J. Combin. Theory Ser. B, 97(4), 627–646.Google Scholar

Feng, Yan-Quan, and Nedela, Roman. 2006. Symmetric cubic graphs of girth at most 7. Acta Univ. M. Belii Ser. Math., 33–55.Google Scholar

Feng, Yan-Quan, and Wang, Kaishun. 2003. s-regular cyclic coverings of the three-dimensional hypercube Q₃. European J. Combin., 24(6), 719–731.Google Scholar

Feng, Yan-Quan, Wang, Kaishun, and Zhou, Chuixiang. 2007. Tetravalent half-transitive graphs of order 4p. European J. Combin., 28(3), 726–733.Google Scholar

Feng, Yan-Quan, Hujdurović, Ademir, Kovács, István, Kutnar, Klavdija, and Marušič, Dragan. 2019. Quasi-semiregular automorphisms of cubic and tetravalent arc-transitive graphs. Appl. Math. Comput., 353, 329–337.Google Scholar

Feng, Yan-Quan, Kovács, István, Wang, Jie, and Yang, Da-Wei. 2020. Existence of non-Cayley Haar graphs. European J. Combin., 89, 103146, 12.Google Scholar

Folkman, Jon. 1967. Regular line-symmetric graphs. J. Combin. Theory, 3, 215–232.Google Scholar

Foster, Ronald M. 1988. The Foster Census. Charles Babbage Research Centre, Winnipeg, MB. R. M. Foster’s census of connected symmetric trivalent graphs, With a foreword by H. S. M. Coxeter, With a biographical preface by Seymour Schuster, With an introduction by I. Z. Bouwer, W. W. Chernoff, B. Monson and Z. Star, Edited and with a note by Bouwer.Google Scholar

Fronček, Dalibor, Rosa, Alexander, and Širáň, Jozef. 1996. The existence of selfcomplementary circulant graphs. European J. Combin., 17(7), 625–628.Google Scholar

Frucht, Roberto. 1936/37. Die gruppe des Petersen’schen Graphen und der Kantensysteme der regularen Polyeder. Comment. Math. Helv., 9, 217–223.Google Scholar

Frucht, Robert. 1952. A one-regular graph of degree three. Canadian J. Math., 4, 240–247.Google Scholar

Frucht, Roberto. 1970. How to describe a graph. Ann. New York Acad. Sci., 175, 159–167.Google Scholar

Frucht, Roberto, Graver, Jack E., and Watkins, Mark E. 1971. The groups of the generalized Petersen graphs. Proc. Cambridge Philos. Soc., 70, 211–218.Google Scholar

Gallai, T. 1968. On directed paths and circuits. Pages 115–118 of: Theory of Graphs (Proc. Colloq., Tihany, 1966). Academic Press, New York.Google Scholar

GAP. 2019. GAP – Groups, Algorithms, and Programming, Version 4.10.2. The GAP Group. Website. www.gap-system.orgGoogle Scholar

Gardiner, A. 1973. Arc transitivity in graphs. Quart. J. Math. Oxford Ser. (2), 24, 399–407.CrossRefGoogle Scholar

Gardiner, A. 1974. Arc transitivity in graphs. II. Quart. J. Math. Oxford Ser. (2), 25, 163–167.Google Scholar

Gardiner, A. 1976. Arc transitivity in graphs. III. Quart. J. Math. Oxford Ser. (2), 27(107), 313–323.Google Scholar

Ghaderpour, Ebrahim, and Morris, Dave Witte. 2011. Cayley graphs of order 27p are Hamiltonian. Int. J. Comb., Art. ID 206930, 16.Google Scholar

Ghaderpour, Ebrahim, and Morris, Dave Witte. 2012. Cayley graphs of order 30p are Hamiltonian. Discrete Math., 312(24), 3614–3625.Google Scholar

Ghaderpour, Ebrahim, and Morris, Dave Witte. 2014. Cayley graphs on nilpotent groups with cyclic commutator subgroup are Hamiltonian. Ars Math. Contemp., 7(1), 55–72.Google Scholar

Giudici, Michael. 2003. Quasiprimitive groups with no fixed point free elements of prime order. J. London Math. Soc. (2), 67(1), 73–84.Google Scholar

Giudici, Michael. 2007. New constructions of groups without semiregular subgroups. Comm. Algebra, 35(9), 2719–2730.Google Scholar

Giudici, Michael, and Smith, Murray R. 2010. A note on quotients of strongly regular graphs. Ars Math. Contemp., 3(2), 147–150.Google Scholar

Giudici, Michael, and Verret, Gabriel. 2020. Arc-transitive graphs of valency twice a prime admit a semiregular automorphism. Ars Math. Contemp., 18(1), 179–186.Google Scholar

Giudici, Michael, and Xu, Jing. 2007. All vertex-transitive locally-quasiprimitive graphs have a semiregular automorphism. J. Algebraic Combin., 25(2), 217–232.Google Scholar

Giudici, Michael, Li, Cai Heng, Potočnik, Primož, and Praeger, Cheryl E. 2007. Homogeneous factorisations of complete multipartite graphs. Discrete Math., 307(3–5), 415–431.Google Scholar

Giudici, Michael, Li, Cai Heng, Potočnik, Primož, and Praeger, Cheryl E. 2008. Homogeneous factorisations of graph products. Discrete Math., 308(16), 3652–3667.Google Scholar

Glover, Henry, and Marušič, Dragan. 2007. Hamiltonicity of cubic Cayley graphs. J. Eur. Math. Soc. (JEMS), 9(4), 775–787.Google Scholar

Glover, H. H., and Yang, T. Y. 1996. A Hamilton cycle in the Cayley graph of the ‹2, p, 3› presentation of PSL₂(p). Discrete Math., 160(1-3), 149–163.Google Scholar

Glover, Henry H., Kutnar, Klavdija, and Marušič, Dragan. 2009. Hamiltonian cycles in cubic Cayley graphs: the ‹2, 4k, 3› case. J. Algebraic Combin., 30(4), 447–475.Google Scholar

Glover, Henry H., Kutnar, Klavdija, Malnič, Aleksander, and Marušič, Dragan. 2012. Hamilton cycles in (2, odd, 3)-Cayley graphs. Proc. Lond. Math. Soc. (3), 104(6), 1171–1197.Google Scholar

Godsil, C. D. 1980. More odd graph theory. Discrete Math., 32(2), 205–207.Google Scholar

Godsil, C. D. 1981a. GRRs for nonsolvable groups. Pages 221–239 of: Algebraic Methods in Graph Theory, Vol. I, II (Szeged, 1978). Colloq. Math. Soc. János Bolyai, vol. 25. North-Holland, Amsterdam.Google Scholar

Godsil, C. D. 1981b. On the full automorphism group of a graph. Combinatorica, 1(3), 243–256.CrossRefGoogle Scholar

Godsil, C. D. 1983. On Cayley graph isomorphisms. Ars Combin., 15, 231–246.Google Scholar

Godsil, Chris, and Royle, Gordon. 2001. Algebraic Graph Theory. Graduate Texts in Mathematics, vol. 207. Springer-Verlag, New York.Google Scholar

Goldschmidt, David M. 1980. Automorphisms of trivalent graphs. Ann. of Math. (2), 111(2), 377–406.CrossRefGoogle Scholar

Gorenstein, Daniel. 1968. Finite Groups. Harper & Row Publishers, New York.Google Scholar

Graham, R. L., Grötschel, M., and Lovász, L. (eds). 1995. Handbook of Combinatorics. Vol. 1, 2. Elsevier Science B.V., Amsterdam; MIT Press, Cambridge, MA.Google Scholar

Gray, F. 1953. Pulse Code Communication. US Patent 2632058. Issued March 17, 1953.Google Scholar

Gross, Fletcher. 1987. Conjugacy of odd order Hall subgroups. Bull. London Math. Soc., 19(4), 311–319.Google Scholar

Gross, Jonathan L., and Tucker, Thomas W. 1987. Topological Graph Theory. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons, Inc., New York. A Wiley-Interscience Publication.Google Scholar

Grünbaum, Branko. 2009. Configurations of Points and Lines. Graduate Studies in Mathematics, vol. 103. American Mathematical Society, Providence, RI.Google Scholar

Guralnick, Robert M. 1983. Subgroups of prime power index in a simple group. J. Algebra, 81(2), 304–311.Google Scholar

Guy, Richard Kenneth (ed). 1970. Combinatorial structures and their applications. Proceedings of the Calgary International Conference on Combinatorial Structures and Their Applications Held at the University of Calgary, Calgary, Alberta, Canada, June, vol. 1969. Gordon and Breach Science Publishers, New York.Google Scholar

Han, Hua, and Lu, Zai Ping. 2013. Affine primitive groups and semisymmetric graphs. Electron. J. Combin., 20(2), P39.Google Scholar

Harary, Frank. 1959. On the group of the composition of two graphs. Duke Math. J., 26, 29–34.Google Scholar

Hassani, Akbar, Iranmanesh, Mohammad A., and Praeger, Cheryl E. 1998. On vertex-imprimitive graphs of order a product of three distinct odd primes. J. Combin. Math. Combin. Comput., 28, 187–213. Papers in honour of Anne Penfold Street.Google Scholar

Higman, D. G. 1967. Intersection matrices for finite permutation groups. J. Algebra, 6, 22–42.Google Scholar

Hladnik, Milan, Marušič, Dragan, and Pisanski, Tomaž. 2002. Cyclic Haar graphs. Discrete Math., 244(1–3), 137–152.Google Scholar

Holt, D. F. 1981. A graph which is edge transitive but not arc transitive. J. Graph Theory, 5(2), 201–204.Google Scholar

Holt, Derek, and Royle, Gordon. 2020. A census of small transitive groups and vertex-transitive graphs. J. Symbolic Comput., 101, 51–60.Google Scholar

Holton, D. 1982. Research problem 9. Discrete Math., 38(1), 125.Google Scholar

Holton, D. A., and Sheehan, J. 1993. The Petersen Graph. Australian Mathematical Society Lecture Series, vol. 7. Cambridge University Press, Cambridge.Google Scholar

Howard, Ben, Millson, John, Snowden, Andrew, and Vakil, Ravi. 2008. A description of the outer automorphism of S₆, and the invariants of six points in projective space. J. Combin. Theory Ser. A, 115(7), 1296–1303.Google Scholar

Hua, Xiao-Hui, Feng, Yan-Quan, and Lee, Jaeun. 2011. Pentavalent symmetric graphs of order 2pq. Discrete Math., 311(20), 2259–2267.Google Scholar

Hujdurović, Ademir, Kutnar, Klavdija, and Marušič, Dragan. 2013. On prime-valent symmetric bicirculants and Cayley snarks. Pages 196–203 of: Geometric Science of Information. Lecture Notes in Comput. Sci., vol. 8085. Springer, Heidelberg.Google Scholar

Hujdurović, Ademir, Kutnar, Klavdija, and Marušič, Dragan. 2014. Half-arc-transitive group actions with a small number of alternets. J. Combin. Theory Ser. A, 124, 114–129.Google Scholar

Hujdurović, Ademir, Kutnar, Klavdija, and Marušič, Dragan. 2015. Vertex-transitive generalized Cayley graphs which are not Cayley graphs. European J. Combin., 46, 45–50.Google Scholar

Hujdurović, Ademir, Kutnar, Klavdija, and Marušič, Dragan. 2016. Odd automorphisms in vertex-transitive graphs. Ars Math. Contemp., 10(2), 427–437.Google Scholar

Imrich, Wilfried, Klavžar, Sandi, and Rall, Douglas F. 2008. Topics in Graph Theory. Wellesley, MA: A K Peters Ltd. Graphs and their Cartesian product.Google Scholar

Isaacs, I. Martin. 2008. Finite Group Theory. Graduate Studies in Mathematics, vol. 92. American Mathematical Society, Providence, RI.Google Scholar

Ivanov, A. A., and Iofinova, M. E. 1985. Biprimitive cubic graphs. Pages 123–134 of: Investigations in the Algebraic Theory of Combinatorial Objects (Russian). Vsesoyuz. Nauchno-Issled. Inst. Sistem. Issled., Moscow.Google Scholar

Jackson, Bill. 1980. Hamilton cycles in regular 2-connected graphs. J. Combin. Theory Ser. B, 29(1), 27–46.Google Scholar

Jaeger, F. 1974. On vertex-induced forests in cubic graphs. Pages 501–512. Congressus Numerantium, No. X of: Proceedings of the Fifth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, FL, 1974).Google Scholar

Jajcay, Robert, and Li, Cai Heng. 2001. Constructions of self-complementary circulants with no multiplicative isomorphisms. European J. Combin., 22(8), 1093–1100.Google Scholar

Jajcay, Robert, Miklavič, Štefko, Šparl, Primož, and Vasiljević, Gorazd. 2019. On certain edge-transitive bicirculants. Electron. J. Combin., 26(2), P2.6.Google Scholar

Janusz, Gerald, and Rotman, Joseph. 1982. Outer automorphisms of S₆. Amer. Math. Monthly, 89(6), 407–410.Google Scholar

Jones, Gareth A. 1979. Abelian subgroups of simply primitive groups of degree p³, where p is prime. Quart. J. Math. Oxford Ser. (2), 30(117), 53–76.Google Scholar

Jones, Gareth A. 2002. Cyclic regular subgroups of primitive permutation groups. J. Group Theory, 5(4), 403–407.Google Scholar

Jones, Gareth A., and Jajcay, Robert. 2016. Cayley properties of merged Johnson graphs. J. Algebraic Combin., 44(4), 1047–1067.Google Scholar

Jones, Gareth A., and Singerman, David. 1978. Theory of maps on orientable surfaces. Proc. London Math. Soc. (3), 37(2), 273–307.Google Scholar

Jordan, C. 1872. Recherches sur les substitutions. J. Math. Pures Appl., 17, 351–367.Google Scholar

Joseph, Anne. 1995. The isomorphism problem for Cayley digraphs on groups of prime-squared order. Discrete Math., 141(1–3), 173–183.Google Scholar

Kaloujnine, Léo. 1948. La structure des p-groupes de Sylow des groupes symétriques finis. Ann. Sci. École Norm. Sup. (3), 65, 239–276.Google Scholar

Kalužnin, L. A., and Klin, M. H. 1976. Some numerical invariants of permutation groups. Latviĭsk. Mat. Ežegodnik, 81–99, 222.Google Scholar

Kantor, William M. 1985. Classification of 2-transitive symmetric designs. Graphs Combin., 1(2), 165–166.Google Scholar

Katona, G. O. H. 1972. A simple proof of the Erdős–Chao Ko–Rado theorem. J. Combin. Theory Ser. B, 13, 183–184.Google Scholar

Keating, Kevin, and Witte, David. 1985. On Hamilton cycles in Cayley graphs in groups with cyclic commutator subgroup. Pages 89–102 of: Cycles in Graphs (Burnaby, B.C., 1982). North-Holland Math. Stud., vol. 115. North-Holland, Amsterdam.Google Scholar

Kleidman, Peter, and Liebeck, Martin. 1990. The Subgroup Structure of the Finite Classical Groups. London Mathematical Society Lecture Note Series, vol. 129. Cambridge University Press, Cambridge.Google Scholar

Klin, M. H., and Pöschel, R. 1981. The König problem, the isomorphism problem for cyclic graphs and the method of Schur rings. Pages 405–434 of: Algebraic methods in graph theory, Vol. I, II (Szeged, 1978). Colloq. Math. Soc. János Bolyai, vol. 25. North-Holland, Amsterdam.Google Scholar

Klin, Mikhail, Lauri, Josef, and Ziv-Av, Matan. 2012. Links between two semisymmetric graphs on 112 vertices via association schemes. J. Symbolic Comput., 47(10), 1175–1191.Google Scholar

Kneser, M. 1955. Aufgabe 300. Jber. Deutsch. Math.-Verein, 58, 27.Google Scholar

Koike, Hiroki, and Kovács, István. 2014. Isomorphic tetravalent cyclic Haar graphs. Ars Math. Contemp., 7(1), 215–235.CrossRefGoogle Scholar

Koike, Hiroki, Kovács, István, Marušič, Dragan, and Muzychuk, Mikhail. 2019. Cyclic groups are CI-groups for balanced configurations. Des. Codes Cryptogr., 87(6), 1227–1235.Google Scholar

Kotlov, Andrew, and Lovász, László. 1996. The rank and size of graphs. J. Graph Theory, 23(2), 185–189.Google Scholar

Kovács, István. 2004. Classifying arc-transitive circulants. J. Algebraic Combin., 20(3), 353–358.Google Scholar

Kovács, István, and Ryabov, Grigory. 2022. The group is a DCI-group. Discrete Math. 345(3), Paper No. 112705, 15.Google Scholar

Kovács, István, and Servatius, Mary. 2012. On Cayley digraphs on nonisomorphic 2-groups. J. Graph Theory, 70(4), 435–448.Google Scholar

Kovács, István, Kutnar, Klavdija, and Marušič, Dragan. 2010. Classification of edgetransitive rose window graphs. J. Graph Theory, 65(3), 216–231.Google Scholar

Kovács, István, Marušič, Dragan, and Muzychuk, Mikhail E. 2011. On dihedrants admitting arc-regular group actions. J. Algebraic Combin., 33(3), 409–426.Google Scholar

Kovács, István, Marušič, Dragan, and Muzychuk, Mikhail. 2013. On G-arc-regular dihedrants and regular dihedral maps. J. Algebraic Combin., 38(2), 437–455.Google Scholar

Kowalewski, A. 1917. W.R. Hamilton’s Dodeaederaufgabe als Buntordnungsproblem. Sitzungsber. Akad. Wiss. Wien (Abt. IIa), 126, 67–90, 963–1007.Google Scholar

Krasner, Marc, and Kaloujnine, Léo. 1951. Produit complet des groupes de permutations et problème de groupes. II. Acta Sci. Math. (Szeged), 14, 39–66.Google Scholar

Kriloff, Cathy, and Lay, Terry. 2014. Hamiltonian cycles in Cayley graphs of imprimitive complex reflection groups. Discrete Math., 326, 50–60.Google Scholar

Krivelevich, Michael, and Sudakov, Benny. 2003. Sparse pseudo-random graphs are Hamiltonian. J. Graph Theory, 42(1), 17–33.Google Scholar

Kutnar, Klavdija, and Marušič, Dragan. 2008a. Hamiltonicity of vertex-transitive graphs of order 4 p. European J. Combin., 29(2), 423–438.Google Scholar

Kutnar, Klavdija, and Marušič, Dragan. 2008b. Recent trends and future directions in vertex-transitive graphs. Ars Math. Contemp., 1(2), 112–125.Google Scholar

Kutnar, Klavdija, and Marušič, Dragan. 2009a. A complete classification of cubic symmetric graphs of girth 6. J. Combin. Theory Ser. B, 99(1), 162–184.Google Scholar

Kutnar, Klavdija, and Marušič, Dragan. 2009b. Hamilton cycles and paths in vertextransitive graphs – current directions. Discrete Math., 309(17), 5491–5500.Google Scholar

Kutnar, Klavdija, and Marušič, Dragan. 2019. Odd extensions of transitive groups via symmetric graphs – the cubic case. J. Combin. Theory Ser. B, 136, 170–192.Google Scholar

Kutnar, Klavdija, and Šparl, Primož. 2009. Hamilton paths and cycles in vertex-transitive graphs of order 6p. Discrete Math., 309(17), 5444–5460.Google Scholar

Kutnar, Klavdija, and Šparl, Primož. 2010. Distance-transitive graphs admit semiregular automorphisms. European J. Combin., 31(1), 25–28.Google Scholar

Kutnar, Klavdija, Marušič, Dragan, Miklavič, Štefko, and Šparl, Primož. 2009. Strongly regular tri-Cayley graphs. European J. Combin., 30(4), 822–832.Google Scholar

Kutnar, Klavdija, Marušič, Dragan, and Šparl, Primož. 2010. An infinite family of half-arc-transitive graphs with universal reachability relation. European J. Combin., 31(7), 1725–1734.Google Scholar

Kutnar, K., Marušič, D., Morris, D. W., Morris, J., and Šparl, P. 2012a. Hamiltonian cycles in Cayley graphs whose order has few prime factors. Ars Math. Contemp., 5(1), 27–71.Google Scholar

Kutnar, Klavdija, Marušič, Dragan, and Zhang, Cui. 2012b. Hamilton paths in vertex-transitive graphs of order 10p. European J. Combin., 33(6), 1043–1077.Google Scholar

Lambossy, P. 1931. Sur une manière de différencier les fonctions cycliques d’une forme donnée. Comment. Math. Helv., 3(1), 69–102.Google Scholar

Leung, Ka Hin, and Man, Shing Hing. 1996. On Schur rings over cyclic groups. II. J. Algebra, 183(2), 273–285.Google Scholar

Leung, Ka Hin, and Man, Shing Hing. 1998. On Schur rings over cyclic groups. Israel J. Math., 106, 251–267.Google Scholar

Levi, F. W. 1942. Finite Geometrical Systems. University of Calcutta, Calcutta.Google Scholar

Li, Cai Heng. 1998. On isomorphisms of connected Cayley graphs. Discrete Math., 178(1–3), 109–122.Google Scholar

Li, Cai Heng. 1999. Finite CI-groups are soluble. Bull. London Math. Soc., 31(4), 419–423.Google Scholar

Li, Cai Heng. 2002. On isomorphisms of finite Cayley graphs – a survey. Discrete Math., 256(1–2), 301–334.Google Scholar

Li, Cai Heng. 2003. The finite primitive permutation groups containing an abelian regular subgroup. Proc. London Math. Soc. (3), 87(3), 725–747.Google Scholar

Li, Cai Heng. 2005. Permutation groups with a cyclic regular subgroup and arc transitive circulants. J. Algebraic Combin., 21(2), 131–136.Google Scholar

Li, Cai Heng, and Praeger, Cheryl E. 2002. Constructing homogeneous factorisations of complete graphs and digraphs. Graphs Combin., 18(4), 757–761.Google Scholar

Li, Cai Heng, and Seress, Ákos. 2003. The primitive permutation groups of squarefree degree. Bull. London Math. Soc., 35(5), 635–644.Google Scholar

Li, Cai Heng, and Seress, Ákos. 2005. On vertex-transitive non-Cayley graphs of square-free order. Des. Codes Cryptogr., 34(2–3), 265–281.Google Scholar

Li, Cai Heng, and Sim, Hyo-Seob. 2001. On half-transitive metacirculant graphs of prime-power order. J. Combin. Theory Ser. B, 81(1), 45–57.Google Scholar

Li, Cai Heng, Lu, Zai Ping, and Marušič, Dragan. 2004. On primitive permutation groups with small suborbits and their orbital graphs. J. Algebra, 279(2), 749–770.CrossRefGoogle Scholar

Li, Cai Heng, Lu, Zai Ping, and Pálfy, P. P. 2007. Further restrictions on the structure of finite CI-groups. J. Algebraic Combin., 26(2), 161–181.Google Scholar

Li, Cai Heng, Lim, Tian Khoon, and Praeger, Cheryl E. 2009. Homogeneous factorisations of complete graphs with edge-transitive factors. J. Algebraic Combin., 29(1), 107–132.Google Scholar

Li, Cai Heng, Song, Shu Jiao, and Wang, Dian Jun. 2013. A characterization of metacirculants. J. Combin. Theory Ser. A, 120(1), 39–48.Google Scholar

Li, Cai Heng, Sun, Shaohui, and Xu, Jing. 2014. Self-complementary circulants of prime-power order. SIAM J. Discrete Math., 28(1), 8–17.Google Scholar

Liebeck, Martin W., and Saxl, Jan. 1985a. Primitive permutation groups containing an element of large prime order. J. London Math. Soc. (2), 31(2), 237–249.Google Scholar

Liebeck, Martin W., and Saxl, Jan. 1985b. The primitive permutation groups of odd degree. J. London Math. Soc. (2), 31(2), 250–264.Google Scholar

Liebeck, Martin W., and Seitz, Gary M. 1990. Maximal subgroups of exceptional groups of Lie type, finite and algebraic. Geom. Dedicata, 35(1–3), 353–387.Google Scholar

Liebeck, Martin W., and Seitz, Gary M. 1999. On finite subgroups of exceptional algebraic groups. J. Reine Angew. Math., 515, 25–72.Google Scholar

Liebeck, Martin W., and Seitz, Gary M. 2004. The maximal subgroups of positive dimension in exceptional algebraic groups. Mem. Amer. Math. Soc., 169(802), vi+227.Google Scholar

Liebeck, Martin W., and Seitz, Gary M. 2005. Maximal subgroups of large rank in exceptional groups of Lie type. J. London Math. Soc. (2), 71(2), 345–361.Google Scholar

Liebeck, Martin W., Praeger, Cheryl E., and Saxl, Jan. 1987. A classification of the maximal subgroups of the finite alternating and symmetric groups. J. Algebra, 111(2), 365–383.Google Scholar

Liebeck, Martin W., Praeger, Cheryl E., and Saxl, Jan. 1988. On the O’Nan-Scott theorem for finite primitive permutation groups. J. Austral. Math. Soc. Ser. A, 44(3), 389–396.Google Scholar

Liebeck, Martin W., Praeger, Cheryl E., and Saxl, Jan. 2010. Regular subgroups of primitive permutation groups. Mem. Amer. Math. Soc., 203(952), vi+74.Google Scholar

Lipschutz, Seymour, and Xu, Ming-Yao. 2002. Note on infinite families of trivalent semisymmetric graphs. European J. Combin., 23(6), 707–711.Google Scholar

Liskovets, Valery, and Pöschel, Reinhard. 2000. Non-Cayley-isomorphic self-complementary circulant graphs. J. Graph Theory, 34(2), 128–141.Google Scholar

Livingstone, Donald, and Wagner, Ascher. 1965. Transitivity of finite permutation groups on unordered sets. Math. Z., 90, 393–403.Google Scholar

Lorimer, Peter. 1984. Vertex-transitive graphs: symmetric graphs of prime valency. J. Graph Theory, 8(1), 55–68.Google Scholar

Lovász, L. 1978. Kneser’s conjecture, chromatic number, and homotopy. J. Combin. Theory Ser. A, 25(3), 319–324.Google Scholar

Lovász, L. 1979. Combinatorial Problems and Exercises. North-Holland Publishing Co., Amsterdam-New York.Google Scholar

Lovrečič Saražin, Marko. 1997. A note on the generalized Petersen graphs that are also Cayley graphs. J. Combin. Theory Ser. B, 69(2), 226–229.Google Scholar

Luks, Eugene M. 1982. Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. System Sci., 25(1), 42–65.Google Scholar

Malnič, Aleksander, and Marušič, Dragan. 2002. Constructing -arc-transitive graphs of valency 4 and vertex stabilizer Z₂ × Z₂. Discrete Math., 245(1–3), 203–216.Google Scholar

Malnič, Aleksander, and Marušič, Dragan. 2002b. Constructing -arc-transitive graphs of valency 4 and vertex stabilizer Z₂ × Z₂. Discrete Math., 245(1-3), 203–216.Google Scholar

Malnič, Aleksander, Nedela, Roman, and Škoviera, Martin. 2000. Lifting graph automorphisms by voltage assignments. European J. Combin., 21(7), 927–947.Google Scholar

Malnič, Aleksander, Marušič, Dragan, and Šparl, Primož. 2007a. On strongly regular bicirculants. European J. Combin., 28(3), 891–900.Google Scholar

Malnič, Aleksander, Marušič, Dragan, Miklavič, Štefko, and Potočnik, Primož. 2007b. Semisymmetric elementary abelian covers of the Möbius–Kantor graph. Discrete Math., 307(17–18), 2156–2175.Google Scholar

Marušič, D. 1985.Vertex transitive graphs and digraphs of order p_k. Pages 115–128 of: Cycles in Graphs (Burnaby, BC, 1982). North-Holland Math. Stud., vol. 115. Amsterdam: North-Holland.Google Scholar

Marušič, Dragan. 1981a. On vertex symmetric digraphs. Discrete Math., 36(1), 69–81.Google Scholar

Marušič, Dragan. 1981b. On Vertex Symmetric Digraphs. PhD thesis, University of Reading.Google Scholar

Marušič, Dragan. 1983. Cayley properties of vertex symmetric graphs. Ars Combin., 16(B), 297–302.Google Scholar

Marušič, Dragan. 1987. Hamiltonian cycles in vertex symmetric graphs of order 2p². Discrete Math., 66(1–2), 169–174.Google Scholar

Marušič, Dragan. 1988a. On vertex-transitive graphs of order qp. J. Combin. Math. Combin. Comput., 4, 97–114.Google Scholar

Marušič, Dragan. 1988b. Strongly regular bicirculants and tricirculants. Ars Combin., 25(C), 11–15. Eleventh British Combinatorial Conference (London, 1987).Google Scholar

Marušič, Dragan. 1992. Hamiltonicity of vertex-transitive pq-graphs. Pages 209–212 of: Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity (Prachatice, 1990). Ann. Discrete Math., vol. 51. North-Holland, Amsterdam.Google Scholar

Marušič, Dragan. 1998. Half-transitive group actions on finite graphs of valency 4. J. Combin. Theory Ser. B, 73(1), 41–76.Google Scholar

Marušič, Dragan. 2000. Constructing cubic edge-but not vertex-transitive graphs. J. Graph Theory, 35(2), 152–160.Google Scholar

Marušič, Dragan. 2003. On 2-arc-transitivity of Cayley graphs. J. Combin. Theory Ser. B, 87(1), 162–196. Dedicated to Crispin Nash-Williams, St. J. A..Google Scholar

Marušič, Dragan. 2005. Quartic half-arc-transitive graphs with large vertex stabilizers. Discrete Math., 299(1–3), 180–193.Google Scholar

Marušič, Dragan. 2018. Semiregular automorphisms in vertex-transitive graphs of order 3p². Electron. J. Combin., 25(2), P2.25.Google Scholar

Marušič, Dragan, and Nedela, Roman. 2001a. On the point stabilizers of transitive groups with non-self-paired suborbits of length 2. J. Group Theory, 4(1), 19–43.Google Scholar

Marušič, Dragan, and Nedela, Roman. 2001b. Partial line graph operator and half-arc-transitive group actions. Math. Slovaca, 51(3), 241–257.Google Scholar

Marušič, Dragan, and Parsons, T. D. 1982. Hamiltonian paths in vertex-symmetric graphs of order 5p. Discrete Math., 42(2–3), 227–242.Google Scholar

Marušič, Dragan, and Parsons, T. D. 1983. Hamiltonian paths in vertex-symmetric graphs of order 4p. Discrete Math., 43(1), 91–96.Google Scholar

Marušič, Dragan, and Pisanski, Tomaž. 2000. The remarkable generalized Petersen graph G(8, 3). Math. Slovaca, 50(2), 117–121.Google Scholar

Marušič, Dragan, and Praeger, Cheryl E. 1999. Tetravalent graphs admitting half-transitive group actions: alternating cycles. J. Combin. Theory Ser. B, 75(2), 188–205.Google Scholar

Marušič, Dragan, and Scapellato, Raffaele. 1992a. Characterizing vertex-transitive pq-graphs with an imprimitive automorphism subgroup. J. Graph Theory, 16(4), 375–387.Google Scholar

Marušič, Dragan, and Potočnik, Primož. 2001. Semisymmetry of generalized Folkman graphs. European J. Combin., 22(3), 333–349.Google Scholar

Marušič, Dragan, and Potočnik, Primož. 2002. Bridging semisymmetric and half-arc-transitive actions on graphs. European J. Combin., 23(6), 719–732.Google Scholar

Marušič, Dragan, and Scapellato, Raffaele. 1992b. A class of non-Cayley vertex-transitive graphs associated with PSL(2, p). Discrete Math., 109(1–3), 161–170. Algebraic graph theory (Leibnitz, 1989).Google Scholar

Marušič, Dragan, and Scapellato, Raffaele. 1993. Imprimitive representations of SL(2, 2^k). J. Combin. Theory Ser. B, 58(1), 46–57.Google Scholar

Marušič, Dragan, and Scapellato, Raffaele. 1994a. A class of graphs arising from the action of PSL(2, q²) on cosets of PGL(2, q). Discrete Math., 134(1–3), 99–110. Algebraic and topological methods in graph theory.Google Scholar

Marušič, D., and Scapellato, R. 1994b. Classifying vertex-transitive graphs whose order is a product of two primes. Combinatorica, 14(2), 187–201.Google Scholar

Marušič, Dragan, and Scapellato, Raffaele. 1994c. Permutation groups with conjugacy complete stabilizers. Discrete Math., 134(1–3), 93–98.Google Scholar

Marušič, Dragan, and Scapellato, Raffaele. 1998. Permutation groups, vertex-transitive digraphs and semiregular automorphisms. European J. Combin., 19(6), 707–712.Google Scholar

Marušič, Dragan, and Šparl, Primož. 2008. On quartic half-arc-transitive metacirculants. J. Algebraic Combin., 28(3), 365–395.Google Scholar

Marušič, Dragan, and Xu, Ming-Yao. 1997. A -transitive graph of valency 4 with a nonsolvable group of automorphisms. J. Graph Theory, 25(2), 133–138.Google Scholar

Marušič, Dragan, Scapellato, Raffaele, and Zagaglia Salvi, Norma. 1992. Generalized Cayley graphs. Discrete Math., 102(3), 279–285.Google Scholar

McKay, Brendan D., and Praeger, Cheryl E. 1994. Vertex-transitive graphs which are not Cayley graphs. I. J. Austral. Math. Soc. Ser. A, 56(1), 53–63.Google Scholar

McKay, Brendan D., and Praeger, Cheryl E. 1996. Vertex-transitive graphs that are not Cayley graphs. II. J. Graph Theory, 22(4), 321–334.Google Scholar

McKay, Brendan D., and Royle, Gordon F. 1990. The transitive graphs with at most 26 vertices. Ars Combin., 30, 161–176.Google Scholar

Miklavič, Štefko, Potočnik, Primož, and Wilson, Steve. 2007a. Consistent cycles in graphs and digraphs. Graphs Combin., 23(2), 205–216.Google Scholar

Miklavič, Štefko, Potočnik, Primož, and Wilson, Steve. 2007b. Overlap in consistent cycles. J. Graph Theory, 55(1), 55–71.Google Scholar

Miller, G. A. 1903. A fundamental theorem with respect to transitive substitution groups. Bull. Amer. Math. Soc., 9(10), 543–544.Google Scholar

Miller, G. A. 1915. Limits of the degree of transitivity of substitution groups. Bull. Amer. Math. Soc., 22(2), 68–71.Google Scholar

Miller, Robert C. 1971. The trivalent symmetric graphs of girth at most six. J. Combin. Theory Ser. B, 10, 163–182.Google Scholar

Mohar, Bojan. 1992. A domain monotonicity theorem for graphs and Hamiltonicity. Discrete Appl. Math., 36(2), 169–177.Google Scholar

Monson, Barry, Pisanski, Tomaž, Schulte, Egon, and Weiss, Asia Ivić. 2007. Semisymmetric graphs from polytopes. J. Combin. Theory Ser. A, 114(3), 421–435.Google Scholar

Morris, Dave Witte. 2016. Infinitely many nonsolvable groups whose Cayley graphs are hamiltonian. J. Algebra Comb. Discrete Struct. Appl., 3(1), 13–30.Google Scholar

Morris, Dave Witte. 2018. Cayley graphs on groups with commutator subgroup of order 2p are hamiltonian. The Art of Discrete and Applied Math., 1(1), #P04.Google Scholar

Morris, Joy. 1999. Isomorphic Cayley graphs on nonisomorphic groups. J. Graph Theory, 31(4), 345–362.Google Scholar

Morris, Joy, and Spiga, Pablo. 2018a. Asymptotic enumeration of Cayley digraphs. Israel J., Math., 242(1), 401–459.Google Scholar

Morris, Joy, and Spiga, Pablo. 2018b. Classification of finite groups that admit an oriented regular representation. Bull. Lond. Math. Soc., 50(5), 811–831.Google Scholar

Morris, Joy, and Tymburski, Josh. 2018. Most rigid representations and Cayley index. Art Discrete Appl. Math., 1(1).Google Scholar

Morris, Joy, Spiga, Pablo, and Verret, Gabriel. 2015. Automorphisms of Cayley graphs on generalised dicyclic groups. European J. Combin., 43, 68–81.Google Scholar

Müller, Peter. 2013. Permutation groups with a cyclic two-orbits subgroup and monodromy groups of Laurent polynomials. Ann. Sc. Norm. Super. Pisa Cl. Sci. (5), 12(2), 369–438.Google Scholar

Mütze, Torsten, Nummenpalo, Jerri, and Walczak, Bartosz. 2018. Sparse Kneser graphs are Hamiltonian. Pages 912–919 of: STOC’18 – Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. ACM, New York.Google Scholar

Muzychuk, Mikhail. 1995. Ádám’s conjecture is true in the square-free case. J. Combin. Theory Ser. A, 72(1), 118–134.Google Scholar

Muzychuk, Mikhail. 1997. On Ádám’s conjecture for circulant graphs. Discrete Math., 176(1–3), 285–298.Google Scholar

Muzychuk, Mikhail. 1999. On the isomorphism problem for cyclic combinatorial objects. Discrete Math., 197/198, 589–606. 16th British Combinatorial Conference (London, 1997).Google Scholar

Muzychuk, M. 2003. An elementary abelian group of large rank is not a CI-group. Discrete Math., 264(1–3), 167–185. The 2000 Com² MaC Conference on Association Schemes, Codes and Designs (Pohang).Google Scholar

Muzychuk, M. 2004. A solution of the isomorphism problem for circulant graphs. Proc. London Math. Soc. (3), 88(1), 1–41.Google Scholar

Muzychuk, Mikhail. 2015. A solution of an equivalence problem for semisimple cyclic codes. Pages 327–334 of: Topics in Finite Fields. Contemp. Math., vol. 632. Amer. Math. Soc., Providence, RI.Google Scholar

Muzychuk, Mikhail, and Ponomarenko, Ilia. 2009. Schur rings. European J. Combin., 30(6), 1526–1539.Google Scholar

Nedela, Roman, and Škoviera, Martin. 1995a. Which generalized Petersen graphs are Cayley graphs? J. Graph Theory, 19(1), 1–11.Google Scholar

Nedela, Roman, and Škoviera, Martin. 1995b. Atoms of cyclic connectivity in cubic graphs. Math. Slovaca, 45(5), 481–499.Google Scholar

Negami, S. 1985. Uniqueness and Faithfulness of Embeddings of Graphs into Surfaces. PhD thesis, Tokyo Inst. of Technology.Google Scholar

Neumann, Peter M. 1977. Finite permutation groups, edge-coloured graphs and matrices. Pages 82–118 of: Topics in Group Theory and Computation (Proc. Summer School, University College, Galway, 1973).Google Scholar

Neumann, Peter M. 2009. Primitive permutation groups and their section-regular partitions. Michigan Math. J., 58(1), 309–322.Google Scholar

Nowitz, Lewis A. 1968. On the non-existence of graphs with transitive generalized dicyclic groups. J. Combin. Theory, 4, 49–51.Google Scholar

Nowitz, Lewis A. 1992. A non-Cayley-invariant Cayley graph of the elementary abelian group of order 64. Discrete Math., 110(1–3), 223–228.Google Scholar

Ore, Oystein. 1962. Theory of Graphs. American Mathematical Society Colloquium Publications, Vol. XXXVIII. American Mathematical Society, Providence, RI.Google Scholar

Pak, Igor, and Radoičić, Radoš. 2009. Hamiltonian paths in Cayley graphs. Discrete Math., 309(17), 5501–5508.Google Scholar

Pálfy, P. P. 1987. Isomorphism problem for relational structures with a cyclic automorphism. European J. Combin., 8(1), 35–43.Google Scholar

Passman, Donald. 1968. Permutation Groups. W. A. Benjamin, Inc., New York-Amsterdam.Google Scholar

Payan, C., and Sakarovitch, M. 1975. Ensembles cycliquement stables et graphes cubiques. Cahiers Centre Études Recherche Opér., 17(2–4), 319–343.Google Scholar

Pisanski, Tomaž. 2007. A classification of cubic bicirculants. Discrete Math., 307(3–5), 567–578.Google Scholar

Pisanski, Tomaž, and Servatius, Brigitte. 2013. Configurations From a Graphical Viewpoint. Birkhäuser Advanced Texts: Basler Lehrbücher. [Birkhäuser Advanced Texts: Basel Textbooks]. Birkhäuser/Springer, New York.Google Scholar

Ponomarenko, I. N. 2005. Determination of the automorphism group of a circulant association scheme in polynomial time. Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI), 321 (Vopr. Teor. Predst. Algebr. i Grupp. 12), 251–267, 301; English translation in: J. Math. Sci. (2006) 136(3), 3972–3979.Google Scholar

Potočnik, Primož, and Šajna, Mateja. 2006. On almost self-complementary graphs. Discrete Math., 306(1), 107–123.Google Scholar

Potočnik, Primož, and Šajna, Mateja. 2007. Self-complementary two-graphs and almost self-complementary double covers. European J. Combin., 28(6), 1561–1574.Google Scholar

Potočnik, Primož, and Šajna, Mateja. 2009. Vertex-transitive self-complementary uniform hypergraphs. European J. Combin., 30(1), 327–337.Google Scholar

Potočnik, Primož, and Wilson, Steve. 2016. Linking rings structures and semisymmetric graphs: Cayley constructions. European J. Combin., 51, 84–98.Google Scholar

Potočnik, Primož, Spiga, Pablo, and Verret, Gabriel. 2012. On graph-restrictive permutation groups. J. Combin. Theory Ser. B, 102(3), 820–831.Google Scholar

Potočnik, Primož, Spiga, Pablo, and Verret, Gabriel. 2013. Cubic vertex-transitive graphs on up to 1280 vertices. J. Symbolic Comput., 50, 465–477.Google Scholar

Potočnik, Primož, Spiga, Pablo, and Verret, Gabriel. 2014. On the order of arc-stabilisers in arc-transitive graphs with prescribed local group. Trans. Amer. Math. Soc., 366(7), 3729–3745.Google Scholar

Potočnik, Primož, Spiga, Pablo, and Verret, Gabriel. 2015. A census of 4-valent half-arc-transitive graphs and arc-transitive digraphs of valence two. Ars Math. Contemp., 8(1), 133–148.Google Scholar

Praeger, Cheryl E. 1985. Imprimitive symmetric graphs. Ars Combin., 19(A), 149–163.Google Scholar

Praeger, Cheryl E. 1993. An O’Nan–Scott theorem for finite quasiprimitive permutation groups and an application to 2-arc transitive graphs. J. London Math. Soc. (2), 47(2), 227–239.Google Scholar

Praeger, Cheryl E., and Xu, Ming Yao. 1993. Vertex-primitive graphs of order a product of two distinct primes. Vertex-primitive graphs of order a product of two distinct primes, 59(2), 245–266.Google Scholar

Praeger, Cheryl, Li, Cai Heng, and Stringer, Linda. 2009. Common circulant homo-geneous factorisations of the complete digraph. Discrete Math., 309(10), 3006–3012.Google Scholar

Praeger, Cheryl E., Spiga, Pablo, and Verret, Gabriel. 2012. Bounding the size of a vertex-stabiliser in a finite vertex-transitive graph. J. Combin. Theory Ser. B, 102(3), 797–819.Google Scholar

Praeger, Cheryl E., Wang, Ru Ji, and Xu, Ming Yao. 1993. Symmetric graphs of order a product of two distinct primes. J. Combin. Theory Ser. B, 58(2), 299–318.Google Scholar

Quirin, William L. 1971. Primitive permutation groups with small orbitals. Math. Z., 122, 267–274.Google Scholar

Ramos Rivera, Alejandra, and Šparl, Primož. 2017. The classification of half-arc-transitive generalizations of Bouwer graphs. European J. Combin., 64, 88–112.Google Scholar

Ramos Rivera, Alejandra, and Šparl, Primož. 2019. New structural results on tetravalent half-arc-transitive graphs. J. Combin. Theory Ser. B, 135, 256–278.Google Scholar

Ramras, Mark, and Donovan, Elizabeth. 2011. The automorphism group of a Johnson graph. Siam J. Discrete Math., 25, 267–270.Google Scholar

Rapaport-Strasser, Elvira. 1959. Cayley color groups and Hamilton lines. Scripta Math., 24, 51–58.Google Scholar

Royle, Gordon F. 2008. A normal non-Cayley-invariant graph for the elementary abelian group of order 64. J. Aust. Math. Soc., 85(3), 347–351.Google Scholar

Ryabov, Grigory. 2020. The Cayley isomorphism property for the group . Ars Math. Contemp., 19(2), 277–295.Google Scholar

Ryabov, Grigory. 2021. The Cayley isomorphism property for the group . Comm. Algebra 49(4), 1788–1804.Google Scholar

Sabidussi, Gert. 1958. On a class of fixed-point-free graphs. Proc. Amer. Math. Soc., 9, 800–804.Google Scholar

Sabidussi, Gert. 1959. The composition of graphs. Duke Math. J., 26, 693–696.Google Scholar

Sabidussi, Gert. 1964. Vertex-transitive graphs. Monatsh. Math., 68, 426–438.Google Scholar

Sachs, Horst. 1962. Über selbstkomplementäre Graphen. Publ. Math. Debrecen, 9, 270–288.Google Scholar

Schur, Issai. 1933. Zur Theorie der einfach transitiven Permutationsgruppen. S. B. Preuss. Akad. Wiss., Phys.-Math. KI, 70, 598–623.Google Scholar

Scott, Leonard L. 1972. On permutation groups of degree 2 p. Math. Z., 126, 227–229.Google Scholar

Scott, W. R. 1987. Group Theory. Second ed. Dover Publications Inc., New York.Google Scholar

Seress, Ákos. 1998. On vertex-transitive, non-Cayley graphs of order pqr. Discrete Math., 182(1–3), 279–292.Google Scholar

Sims, Charles C. 1968. Graphs and finite permutation groups. II. Math. Z., 103, 276–281.Google Scholar

Sjerve, Denis, and Cherkassoff, Michael. 1994. On groups generated by three involutions, two of which commute. Pages 169–185 of: The Hilton Symposium 1993 (Montreal, PQ). CRM Proc. Lecture Notes, vol. 6. Amer. Math. Soc., Providence, RI.Google Scholar

Smith, D. H. 1971. Primitive and imprimitive graphs. Quart. J. Math. Oxford Ser. (2), 22, 551–557.Google Scholar

Somlai, Gábor. 2011. Elementary abelian p-groups of rank 2p + 3 are not CI-groups. J. Algebraic Combin., 34(3), 323–335.Google Scholar

Somlai, Gábor. 2015. The Cayley isomorphism property for groups of order 8p. Ars Math. Contemp., 8(2), 433–444.Google Scholar

Song, Shu Jiao, Li, Cai Heng, and Zhang, Hua. 2014. Finite permutation groups with a regular dihedral subgroup, and edge-transitive dihedrants. J. Algebra, 399, 948–959.Google Scholar

Šparl, Primož. 2008. A classification of tightly attached half-arc-transitive graphs of valency 4. J. Combin. Theory Ser. B, 98(5), 1076–1108.Google Scholar

Spiga, Pablo. 2007. Elementary abelian p-groups of rank greater than or equal to 4p − 2 are not CI-groups. J. Algebraic Combin., 26(3), 343–355.Google Scholar

Spiga, Pablo. 2018. On the existence of Frobenius digraphical representations. Electron. J. Combin., 25(2), P2.6.Google Scholar

Spiga, Pablo. 2021. On the equivalence between a conjecture of Babai–Godsil and a conjecture of Xu concerning the enumeration of Cayley graphs. Art Discrete Appl. Math., 4(1), P1.10.Google Scholar

Steimle, Alice, and Staton, William. 2009. The isomorphism classes of the generalized Petersen graphs. Discrete Math., 309(1), 231–237.Google Scholar

Suprunenko, D. A. 1985. Self-complementary graphs. Kibernetika (Kiev), i, 1–6, 24, 133.Google Scholar

Thomassen, Carsten. 1991. Tilings of the torus and the Klein bottle and vertex-transitive graphs on a fixed surface. Trans. Amer. Math. Soc., 323(2), 605–635.Google Scholar

Trofimov, V. I. 1990. Vertex stabilizers of graphs with projective suborbits. Dokl. Akad. Nauk SSSR, 315(3), 544–546.Google Scholar

Trofimov, V. I. 1991. Graphs with projective suborbits. Izv. Akad. Nauk SSSR Ser. Mat., 55(4), 890–916.Google Scholar

Turner, James. 1967. Point-symmetric graphs with a prime number of points. J. Combin. Theory, 3, 136–145.Google Scholar

Tutte, W. T. 1947. A family of cubical graphs. Proc. Cambridge Philos. Soc., 43, 459–474.Google Scholar

Tutte, W. T. 1959. On the symmetry of cubic graphs. Canad. J. Math., 11, 621–624.Google Scholar

Tutte, W. T. 1960. A non-Hamiltonian graph. Canad. Math. Bull., 3, 1–5.Google Scholar

Tutte, W. T. 1966. Connectivity in graphs. Mathematical Expositions, No. 15. Toronto, Ont.: University of Toronto Press.Google Scholar

Tutte, W. T. 1998. Graph Theory as I Have Known It. Oxford Lecture Series in Mathematics and its Applications, vol. 11. The Clarendon Press, Oxford University Press, New York.Google Scholar

Tyshkevich, R. I., and Tan, Ngo Dak. 1987. A generalization of Babai’s lemma on Cayley graphs. Vestsĭ Akad. Navuk BSSR Ser. Fĭz.-Mat. Navuk, 29–32, 124.Google Scholar