Combinatorics

  1. David Abelson, Seok-Hee Hong, and D. E. Taylor, Geometric automorphism groups of graphs, Discrete Appl. Math. 155 (2007), no. 17, 2211–2226.[MR]
  2. David Abelson, Seok-Hee Hong, and Donald E. Taylor, A group-theoretic method for drawing graphs symmetrically, Graph Drawing, Lecture Notes in Comput. Sci., vol. 2528, Springer, Berlin, 2002, pp. 86–97.[MR]
  3. David Applegate, E. M. Rains, and N. J. A. Sloane, On asymmetric coverings and covering numbers, J. Combin. Des. 11 (2003), no. 3, 218–228.[MR]
  4. Makoto Araya, Masaaki Harada, and Hadi Kharaghani, Some Hadamard matrices of order 32 and their binary codes, J. Combin. Des. 12 (2004), no. 2, 142–146.[MR]
  5. E. F. Assmus, Jr. and J. D. Key, Translation planes and derivation sets, J. Geom. 37 (1990), no. 1-2, 3–16.[MR]
  6. E. F. Assmus, Jr. and J. D. Key, Hadamard matrices and their designs: A coding-theoretic approach, Trans. Amer. Math. Soc. 330 (1992), no. 1, 269–293.[MR]
  7. Christine Bachoc, Harmonic weight enumerators of nonbinary codes and MacWilliams identities, Codes and Association Schemes (Piscataway, NJ, 1999), DIMACS Ser. Discrete Math. Theoret. Comput. Sci., vol. 56, Amer. Math. Soc., Providence, RI, 2001, pp. 1–23.[MR]
  8. R. A. Bailey, Peter J. Cameron, Peter Dobcsányi, John P. Morgan, and Leonard H. Soicher, Designs on the web, Discrete Math. 306 (2006), no. 23, 3014–3027.[MR]
  9. R. D. Baker, G. L. Ebert, J. Hemmeter, and A. Woldar, Maximal cliques in the Paley graph of square order, J. Statist. Plann. Inference 56 (1996), no. 1, 33–38.[MR/doi]
  10. John Bamberg, Geoffrey Pearce, and Cheryl E. Praeger, Transitive decompositions of graph products: Rank 3 grid type, J. Group Theory 11 (2008), no. 2, 185–228.[MR]
  11. John Bamberg and Tim Penttila, A classification of transitive ovoids, spreads, and m-systems of polar spaces, Forum Math. 21 (2009), no. 2, 181–216.[MR]
  12. Eiichi Bannai and Etsuko Bannai, On Euclidean tight 4-designs, J. Math. Soc. Japan 58 (2006), no. 3, 775–804.[MR]
  13. Eiichi Bannai, Osamu Shimabukuro, and Hajime Tanaka, Finite analogues of non-Euclidean spaces and Ramanujan graphs, European J. Combin. 25 (2004), no. 2, 243–259.[MR]
  14. Eiichi Bannai, Osamu Shimabukuro, and Hajime Tanaka, Finite Euclidean graphs and Ramanujan graphs, Discrete Math. 309 (2009), no. 20, 6126–6134.[MR/doi]
  15. Wayne Barrett, Jason Grout, and Raphael Loewy, The minimum rank problem over the finite field of order 2: minimum rank 3, Linear Algebra and its Applications 430 (2009), no. 4, 890–923.[doi]
  16. C. Bates, D. Bundy, Sarah B. Perkins, and P. Rowley, Commuting involution graphs for symmetric groups, J. Algebra 266 (2003), no. 1, 133–153.[MR]
  17. L. M. Batten and J. M. Dover, Some sets of type (m,n) in cubic order planes, Des. Codes Cryptogr. 16 (1999), no. 3, 211–213.[MR]
  18. Thomas Beth, Christopher Charnes, Markus Grassl, Gernot Alber, Aldo Delgado, and Michael Mussinger, A new class of designs which protect against quantum jumps, Des. Codes Cryptogr. 29 (2003), no. 1-3, 51–70.[MR]
  19. Anton Betten, Adalbert Kerber, Reinhard Laue, and Alfred Wassermann, Simple 8-designs with small parameters, Des. Codes Cryptogr. 15 (1998), no. 1, 5–27.[MR]
  20. N. L. Biggs, Presentations for cubic graphs, Computational Group Theory (Durham, 1982), Academic Press, London, 1984, pp. 57–63.[MR]
  21. Norman Biggs, Constructions for cubic graphs with large girth, Electron. J. Combin. 5 (1998), Article 1, 25 pp. (electronic).[MR]
  22. John van Bon and Arjeh M. Cohen, Linear groups and distance-transitive graphs, European J. Combin. 10 (1989), no. 5, 399–411.[MR]
  23. John van Bon, Arjeh M. Cohen, and Hans Cuypers, Graphs related to Held's simple group, J. Algebra 123 (1989), no. 1, 6–26.[MR]
  24. A. Bonnecaze, E. Rains, and P. Solé, 3-colored 5-designs and Z4-codes, J. Statist. Plann. Inference 86 (2000), no. 2, 349–368.[MR]
  25. A. Bonnecaze, P. Solé, and P. Udaya, Tricolore 3-designs in type III codes, Discrete Math. 241 (2001), no. 1-3, 129–138.[MR]
  26. Alexis Bonnecaze, Bernard Mourrain, and Patrick Solé, Jacobi polynomials, type II codes, and designs, Des. Codes Cryptogr. 16 (1999), no. 3, 215–234.[MR]
  27. Alin Bostan, Manuel Kauers, and Mark van Hoeij, The complete generating function for Gessel walks is algebraic, Proc. Amer. Math. Soc. 138 (2010), no. 9, 3063–3078.
  28. Mireille Boutin and Gregor Kemper, Lossless representation of graphs using distributions, preprint (2007), 19 pages.[arXiv]
  29. John M. Boyer and Wendy J. Myrvold, On the cutting edge: Simplified O(n) planarity by edge addition, J. Graph Algorithms Appl. 8 (2004), no. 3, 241–273 (electronic).[MR]
  30. Leonid Brailovsky, Dmitrii V. Pasechnik, and Cheryl E. Praeger, Classification of 2-quasi-invariant subsets, Ars Combin. 42 (1996), 65–76.[MR]
  31. John Bray, Christopher Parker, and Peter Rowley, Cayley type graphs and cubic graphs of large girth, Discrete Math. 214 (2000), no. 1-3, 113–121.[MR]
  32. Thomas Britz and Carrie G. Rutherford, Covering radii are not matroid invariants, Discrete Math. 296 (2005), no. 1, 117–120.[MR]
  33. Thomas Britz and Keisuke Shiromoto, Designs from subcode supports of linear codes, Des. Codes Cryptogr. 46 (2008), no. 2, 175–189.[MR]
  34. S. Allen Broughton, Robert M. Dirks, Maria T. Sloughter, and C. Ryan Vinroot, Triangular surface tiling groups for low genus, Preprint (2001).
  35. Andries E. Brouwer, Naoyuki Horiguchi, Masaaki Kitazume, and Hiroyuki Nakasora, A construction of the sporadic Suzuki graph from U3(4), J. Combin. Theory Ser. A 116 (2009), no. 5, 1056–1062.[MR]
  36. F. Buekenhout, A. Delandtsheer, and J. Doyen, Finite linear spaces with flag-transitive groups, J. Combin. Theory Ser. A 49 (1988), no. 2, 268–293.[MR]
  37. J. Buhler and Z. Reichstein, Symmetric functions and the phase problem in crystallography, Trans. Amer. Math. Soc. 357 (2005), no. 6, 2353–2377 (electronic).[MR]
  38. Peter J. Cameron, Partitions and permutations, Discrete Math. 291 (2005), no. 1-3, 45–54.[MR]
  39. A. R. Camina and L. Di Martino, Block designs on 196 points, Arch. Math. (Basel) 53 (1989), no. 4, 414–416.[MR]
  40. A. R. Camina and L. Di Martino, The group of automorphisms of a transitive 2-(91,6,1) design, Geom. Dedicata 31 (1989), no. 2, 151–164.[MR]
  41. Philippe Cara, Serge Lehman, and Dmitrii V. Pasechnik, On the number of inductively minimal geometries, Theoret. Comput. Sci. 263 (2001), no. 1-2, 31–35.[MR]
  42. I. Cardinali, N. Durante, T. Penttila, and R. Trombetti, Bruen chains over fields of small order, Discrete Math. 282 (2004), no. 1-3, 245–247.[MR]
  43. L. L. Carpenter and J. D. Key, On Hadamard matrices from resolvable Steiner designs, in Proceedings of the Twenty-sixth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1995), vol. 108, 1995, pp. 53–63.[MR]
  44. Pierre Cartier, Combinatorics of trees, Surveys in modern mathematics, London Math. Soc. Lecture Note Ser., vol. 321, Cambridge Univ. Press, Cambridge, 2005, pp. 274–282.[MR]
  45. David B. Chandler and Qing Xiang, Cyclic relative difference sets and their p-ranks, Des. Codes Cryptogr. 30 (2003), no. 3, 325–343.[MR]
  46. Chris Charnes, Martin Rötteler, and Thomas Beth, Homogeneous bent functions, invariants, and designs, Des. Codes Cryptogr. 26 (2002), no. 1-3, 139–154.[MR]
  47. D. Combe, W. D. Palmer, and W. R. Unger, Bhaskar Rao designs and the alternating group A4, Australas. J. Combin. 24 (2001), 275–283.[MR]
  48. Marston Conder, A note on Cayley graphs, J. Combin. Theory Ser. B 40 (1986), no. 3, 362–368.[MR]
  49. Marston Conder, A new 5-arc-transitive cubic graph, J. Graph Theory 11 (1987), no. 3, 303–307.[MR]
  50. Marston Conder, Groups of minimal genus including C2 extensions of PSL(2,q) for certain q, Quart. J. Math. Oxford Ser. (2) 38 (1987), no. 152, 449–460.[MR]
  51. Marston Conder, Maximal automorphism groups of symmetric Riemann surfaces with small genus, J. Algebra 114 (1988), no. 1, 16–28.[MR]
  52. Marston Conder, An infinite family of 4-arc-transitive cubic graphs each with girth 12, Bull. London Math. Soc. 21 (1989), no. 4, 375–380.[MR]
  53. Marston Conder, Constructing symmetric graphs, Theta 3 (1989), 11–16.
  54. Marston Conder, Experimental algebra, Math. Chronicle 20 (1991), 1–11.[MR]
  55. Marston Conder, Group actions on the cubic tree, J. Algebraic Combin. 1 (1992), no. 3, 209–218.[MR]
  56. Marston Conder, Regular maps with small parameters, J. Austral. Math. Soc. Ser. A 57 (1994), no. 1, 103–112.[MR]
  57. Marston Conder, Group actions on graphs, maps and surfaces with maximum symmetry, Groups St. Andrews 2001 in Oxford. Vol. I, London Math. Soc. Lecture Note Ser., vol. 304, Cambridge Univ. Press, Cambridge, 2003, pp. 63–91.[MR]
  58. Marston Conder, Genus spectra for symmetric embeddings of graphs on surfaces, Electronic Notes in Discrete Mathematics 31 (2008), 27–31.[doi]
  59. Marston Conder, On symmetries of Cayley graphs and the graphs underlying regular maps, J. Algebra 321 (2009), no. 11, 3112–3127.[MR]
  60. Marston Conder and Peter Dobcsányi, Determination of all regular maps of small genus, J. Combin. Theory Ser. B 81 (2001), no. 2, 224–242.[MR]
  61. Marston Conder and Peter Dobcsányi, Trivalent symmetric graphs on up to 768 vertices, J. Combin. Math. Combin. Comput. 40 (2002), 41–63.[MR]
  62. Marston Conder and Brent Everitt, Regular maps on non-orientable surfaces, Geom. Dedicata 56 (1995), no. 2, 209–219.[MR]
  63. Marston Conder, Robert Jajcay, and Thomas Tucker, Regular Cayley maps for finite abelian groups, J. Algebraic Combin. 25 (2007), no. 3, 259–283.[MR]
  64. Marston Conder and Cai Heng Li, On isomorphisms of finite Cayley graphs, European J. Combin. 19 (1998), no. 8, 911–919.[MR]
  65. Marston Conder and Peter Lorimer, Automorphism groups of symmetric graphs of valency 3, J. Combin. Theory Ser. B 47 (1989), no. 1, 60–72.[MR]
  66. Marston Conder, Peter Lorimer, and Cheryl Praeger, Constructions for arc-transitive digraphs, J. Austral. Math. Soc. Ser. A 59 (1995), no. 1, 61–80.[MR]
  67. Marston Conder, Aleksander Malnič, Dragan Marušič, Tomaž Pisanski, and Primož Potočnik, The edge-transitive but not vertex-transitive cubic graph on 112 vertices, J. Graph Theory 50 (2005), no. 1, 25–42.[MR]
  68. Marston Conder, Aleksander Malnič, Dragan Marušič, and Primož Potočnik, A census of semisymmetric cubic graphs on up to 768 vertices, J. Algebraic Combin. 23 (2006), no. 3, 255–294.[MR]
  69. Marston Conder and Dragan Marušič, A tetravalent half-arc-transitive graph with non-abelian vertex stabilizer, J. Combin. Theory Ser. B 88 (2003), no. 1, 67–76.[MR]
  70. Marston Conder and John McKay, Markings of the Golay code, New Zealand J. Math. 25 (1996), no. 2, 133–139.[MR]
  71. Marston Conder, Margaret Morton, and Cheryl E. Praeger, Partition graphs for finite symmetric groups, J. Graph Theory 25 (1997), no. 2, 107–117.[MR]
  72. Marston Conder, Margaret Morton, and Cheryl E. Praeger, Two-arc closed subsets of graphs, J. Graph Theory 42 (2003), no. 4, 350–364.[MR]
  73. Marston Conder and Roman Nedela, Symmetric cubic graphs of small girth, J. Combin. Theory Ser. B 97 (2007), no. 5, 757–768.[MR]
  74. Marston Conder and Roman Nedela, A refined classification of symmetric cubic graphs, J. Algebra 322 (2009), no. 3, 722–740.[MR/doi]
  75. Marston Conder and Roman Nedela, A refined classification of symmetric cubic graphs, J. Algebra 322 (2009), no. 1, 722–740.
  76. Marston Conder, Primož Potočnik, and Jozef Širáň, Regular hypermaps over projective linear groups, J. Aust. Math. Soc. 85 (2008), 155–175 pages.
  77. Marston Conder, Jozef Sirán, and Tom Tucker, The genera, reflexibility and simplicity of regular maps, J. Eur. Math. Soc. (JEMS), to appear, 23 pages.
  78. Marston Conder and Cameron G. Walker, The infinitude of 7-arc-transitive graphs, J. Algebra 208 (1998), no. 2, 619–629.[MR]
  79. Marston Conder and Steve Wilson, Inner reflectors and non-orientable regular maps, Discrete Math. 307 (2007), no. 3-5, 367–372.[MR]
  80. Antonio Cossidente and Sam K. J. Vereecke, Some geometry of the isomorphism Sp(4,q)≅O(5,q), q even, J. Geom. 70 (2001), no. 1-2, 28–37.[MR]
  81. Maria Cristeta Cuaresma, Michael Giudici, and Cheryl E. Praeger, Homogeneous factorisations of Johnson graphs, Des. Codes Cryptogr. 46 (2008), no. 3, 303–327.[MR]
  82. M. R. Darafsheh, A. Iranmanesh, and R. Kahkeshani, Some designs and codes invariant under the groups S9 and A8, Des. Codes Cryptogr. 51 (2009), no. 2, 211–223.[MR/doi]
  83. Paul-Olivier Dehaye, Joint moments of derivatives of characteristic polynomials, Algebra Number Theory 2 (2008), no. 1, 31–68.[MR]
  84. Italo J. Dejter, C-homogeneous graphs via ordered pencils, preprint (2007), 18 pages.[arXiv]
  85. Italo J. Dejter, On Clique Turan graph-homogeneity, preprint (2007), 20 pages.[arXiv]
  86. Italo J. Dejter, On a {K4,K2,2,2}-ultrahomogeneous graph., Australas. J. Comb. 44 (2009), 63–75.
  87. Italo J. Dejter, A construction based on the Biggs-Smith graph, preprint (2010), 8 pages.[arXiv]
  88. A. Delgado and R. Weiss, On certain coverings of generalized polygons, Bull. London Math. Soc. 21 (1989), no. 3, 235–242.[MR]
  89. U. Dempwolff, Automorphisms and equivalence of bent functions and of difference sets in elementary abelian 2-groups, Comm. Algebra 34 (2006), no. 3, 1077–1131.[MR]
  90. Alice Devillers and Michael Giudici, Involution graphs where the product of two adjacent vertices has order three, J. Aust. Math. Soc. 85 (2008), no. 3, 305–322.
  91. Alice Devillers, Michael Giudici, Cai Heng Li, and Cheryl E. Praeger, A remarkable Mathieu graph tower, preprint, 23 pages.
  92. Alice Devillers, Michael Giudici, Cai Heng Li, and Cheryl E. Praeger, Primitive decompositions of Johnson graphs, J. Combin. Theory Ser. A 115 (2008), no. 6, 925–966.[MR]
  93. Alice Devillers, Michael Giudici, Cai Heng Li, and Cheryl E. Praeger, An infinite family of biquasiprimitive 2-arc transitive cubic graphs, Preprint (2009), 1–19.
  94. Alice Devillers, Michael Giudici, Cai Heng Li, and Cheryl E. Praeger, Locally s-distance transitive graphs, preprint (2010).[arXiv]
  95. Alice Devillers, Michael Giudici, Cai Heng Li, and Cheryl E. Praeger, Some graphs related to the small Mathieu groups, European J. Combin. 31 (2010), no. 1, 336–348.[MR/doi]
  96. Cunsheng Ding, Zeying Wang, and Qing Xiang, Skew Hadamard difference sets from the Ree-Tits slice symplectic spreads in PG(3,32h+1), J. Combin. Theory Ser. A 114 (2007), no. 5, 867–887.[MR/arXiv]
  97. Cunsheng Ding and Jin Yuan, A family of skew Hadamard difference sets, J. Combin. Theory Ser. A 113 (2006), no. 7, 1526–1535.[MR]
  98. Michael J. Dinneen and Paul R. Hafner, New results for the degree/diameter problem, Networks 24 (1994), no. 7, 359–367.[MR]
  99. Edward Dobson and Dragan Marušič, An unusual decomposition of a complete 7-partite graph of order 28, Discrete Math. 308 (2008), no. 20, 4595–4598.[MR]
  100. Steven T. Dougherty, Jon-Lark Kim, and Patrick Solé, Double circulant codes from two class association schemes, Adv. Math. Commun. 1 (2007), no. 1, 45–64.[MR]
  101. G. L. Ebert, Quasimultiples of geometric designs, Discrete Math. 284 (2004), no. 1-3, 123–129.[MR]
  102. Ronald Evans, Henk D. L. Hollmann, Christian Krattenthaler, and Qing Xiang, Gauss sums, Jacobi sums, and p-ranks of cyclic difference sets, J. Combin. Theory Ser. A 87 (1999), no. 1, 74–119.[MR]
  103. Xin Gui Fang, George Havas, and Cheryl E. Praeger, On the automorphism groups of quasiprimitive almost simple graphs, J. Algebra 222 (1999), no. 1, 271–283.[MR]
  104. Xin Gui Fang, George Havas, and Jie Wang, Automorphism groups of certain non-quasiprimitive almost simple graphs, Groups St. Andrews 1997 in Bath, I, London Math. Soc. Lecture Note Ser., vol. 260, Cambridge Univ. Press, Cambridge, 1999, pp. 267–274.[MR]
  105. Tao Feng, Non-abelian skew hadamard difference sets fixed by a prescribed automorphism, J Combin. Theory Ser. A, to appear (2009).[doi]
  106. Yan-Quan Feng, Klavdija Kutnar, Aleksander Malnič, and Dragan Marušič, On 2-fold covers of graphs, J. Combin. Theory Ser. B 98 (2008), no. 2, 324–341.[MR/arXiv]
  107. Yan-Quan Feng, Jin Ho Kwak, and Chuixiang Zhou, Constructing even radius tightly attached half-arc-transitive graphs of valency four, J. Algebraic Combin. 26 (2007), no. 4, 431–451.[MR]
  108. Louis Ferré and Bertrand Jouve, Vertex partitioning of a class of digraphs, Math. Sci. Hum. (2002), no. 158, 59–77.[MR]
  109. Carla Fiori and Beatrice Ruini, Infinite classes of dihedral snarks, Mediterr. J. Math. 5 (2008), no. 2, 199–210.[MR]
  110. W. Fish, J. D. Key, and E. Mwambene, Graphs, designs and codes related to the n-cube, Discrete Math. 309 (2009), no. 10, 3255–3269.[MR]
  111. D. L. Flannery, Cocyclic Hadamard matrices and Hadamard groups are equivalent, J. Algebra 192 (1997), no. 2, 749–779.[MR]
  112. Anna Fukshansky and Corinna Wiedorn, C-extensions of the Petersen geometry for M22, European J. Combin. 20 (1999), no. 3, 233–238.[MR]
  113. S. Georgiou, I. Kotsireas, and C. Koukouvinos, Inequivalent Hadamard matrices of order 2n constructed from Hadamard matrices of order n, J. Combin. Math. Combin. Comput. 63 (2007), 65–79.[MR]
  114. S. Georgiou and C. Koukouvinos, Some results on orthogonal designs and Hadamard matrices, Int. J. Appl. Math. 17 (2005), no. 4, 433–443.[MR]
  115. Stelios D. Georgiou, New two-variable full orthogonal designs and related experiments with linear regression models, Statist. Probab. Lett. 77 (2007), no. 1, 25–31.[MR]
  116. Michael Giudici, Cai Heng Li, Primož Potočnik, and Cheryl E. Praeger, Homogeneous factorisations of complete multipartite graphs, Discrete Math. 307 (2007), no. 3-5, 415–431.[MR]
  117. Michael Giudici and Aedan Pope, The diameters of commuting graphs of linear groups and matrix rings over the integers modulo m, preprint (2010), 10 pages.[arXiv]
  118. H. H. Glover, K. Kutnar, and Dragan Marušič, Hamiltonian cycles in cubic Cayley graphs: The <2, 4k, 3> case, J. Algebraic Combin., to appear (2009).
  119. Claudia Gohlisch, Helmut Koch, and Gabriele Nebe, Block squares, Math. Nachr. 241 (2002), 73–102.[MR]
  120. Ken Gray, On the minimum number of blocks defining a design, Bull. Austral. Math. Soc. 41 (1990), no. 1, 97–112.[MR]
  121. Jason Grout, Ultraconnected and critical graphs, Master's Thesis, Brigham Young University, 2003.
  122. Paul R. Hafner, Large Cayley graphs and digraphs with small degree and diameter, Computational Algebra and Number Theory (Sydney, 1992), Math. Appl., vol. 325, Kluwer Acad. Publ., Dordrecht, 1995, pp. 291–302.[MR]
  123. Paul R. Hafner, Geometric realisation of the graphs of McKay-Miller-Širáň, J. Combin. Theory Ser. B 90 (2004), no. 2, 223–232.[MR]
  124. Paul R. Hafner, On the graphs of Hoffman-Singleton and Higman-Sims, Electron. J. Combin. 11 (2004), no. 1, Research Paper 77, 33 pp. (electronic).[MR]
  125. Masaaki Harada, On the self-dual F5-codes constructed from Hadamard matrices of order 24, J. Combin. Des. 13 (2005), no. 2, 152–156.[MR]
  126. Masaaki Harada, Self-orthogonal 3-(56,12,65) designs and extremal doubly-even self-dual codes of length 56, Des. Codes Cryptogr. 38 (2006), no. 1, 5–16.[MR]
  127. Masaaki Harada, Clement Lam, and Vladimir D. Tonchev, Symmetric (4,4)-nets and generalized Hadamard matrices over groups of order 4, Des. Codes Cryptogr. 34 (2005), no. 1, 71–87.[MR]
  128. Masaaki Harada and Akihiro Munemasa, A quasi-symmetric 2-(49,9,6) design, J. Combin. Des. 10 (2002), no. 3, 173–179.[MR]
  129. Masaaki Harada and Vladimir D. Tonchev, Self-orthogonal codes from symmetric designs with fixed-point-free automorphisms, Discrete Math. 264 (2003), no. 1-3, 81–90.[MR]
  130. George Havas and Edmund F. Robertson, Two groups which act on cubic graphs, Computational Group Theory (Durham, 1982), Academic Press, London, 1984, pp. 65–68.[MR]
  131. Florent Hivert and Nicolas M. Thiéry, MuPAD-Combinat, an open-source package for research in algebraic combinatorics, Sém. Lothar. Combin. 51 (2004/05), Art. B51z, 70 pp. (electronic).[MR]
  132. K. J. Horadam, An introduction to cocyclic generalised Hadamard matrices, Discrete Appl. Math. 102 (2000), no. 1-2, 115–131.[MR]
  133. K. J. Horadam, Hadamard matrices and their applications, Princeton University Press, Princeton, NJ, 2007, pp. xiv+263.[MR]
  134. Naoyuki Horiguchi, Masaaki Kitazume, and Hiroyuki Nakasora, The Hall-Janko graph and the Witt system W10, European J. Combin. 29 (2008), no. 1, 1–8.[MR]
  135. Naoyuki Horiguchi, Hiroyuki Nakasora, and Takehisa Wakabayashi, On the strongly regular graphs obtained from quasi-symmetric 2-(31,7,7) designs, Bull. Yamagata Univ. Natur. Sci. 16 (2005), no. 1, 1–6.[MR]
  136. Stephen P. Humphries, Quotients of Coxeter complexes, fundamental groupoids and regular graphs, Math. Z. 217 (1994), no. 2, 247–273.[MR]
  137. Stephen P. Humphries and Zane Kun Li, Counting powers of words in monoids, European J. Combin. 30 (2009), no. 5, 1297–1308.[MR]
  138. A. A. Ivanov and Cheryl E. Praeger, On finite affine 2-arc transitive graphs, European J. Combin. 14 (1993), no. 5, 421–444.[MR]
  139. Robert E. Jamison and Gretchen L. Matthews, Distance k colorings of Hamming graphs, in Proceedings of the Thirty-Seventh Southeastern International Conference on Combinatorics, Graph Theory and Computing, vol. 183, 2006, pp. 193–202.[MR]
  140. Masakazu Jimbo and Keisuke Shiromoto, A construction of mutually disjoint Steiner systems from isomorphic Golay codes, J. Combin. Theory Ser. A 116 (2009), no. 7, 1245–1251.[MR/doi]
  141. G. A. Kadir and J. D. Key, The Steiner system S(5,8,24) constructed from dual affine planes, Proc. Roy. Soc. Edinburgh Sect. A 103 (1986), no. 1-2, 147–160.[MR]
  142. M. Kasatani, T. Miwa, A. N. Sergeev, and A. P. Veselov, Coincident root loci and Jack and Macdonald polynomials for special values of the parameters, Jack, Hall-Littlewood and Macdonald Polynomials, Contemp. Math., vol. 417, Amer. Math. Soc., Providence, RI, 2006, pp. 207–225.[MR]
  143. Wen-Fong Ke, On nonisomorphic BIBD with identical parameters, Combinatorics '90 (Gaeta, 1990), Ann. Discrete Math., vol. 52, North-Holland, Amsterdam, 1992, pp. 337–346.[MR]
  144. Peter Keevash and Benny Sudakov, Packing triangles in a graph and its complement, J. Graph Theory 47 (2004), no. 3, 203–216.[MR]
  145. J. D. Key, Extendable Steiner designs, Geom. Dedicata 41 (1992), no. 2, 201–205.[MR]
  146. J. D. Key, On a class of 1-designs, European J. Combin. 14 (1993), no. 1, 37–41.[MR]
  147. J. D. Key, Extendable Steiner designs from finite geometries, J. Statist. Plann. Inference 56 (1996), no. 2, 181–186.[MR]
  148. J. D. Key and K. Mackenzie, Ovals in the designs W(2m), Ars Combin. 33 (1992), 113–117.[MR]
  149. J. D. Key and K. Mackenzie-Fleming, Rigidity theorems for a class of affine resolvable designs, J. Combin. Math. Combin. Comput. 35 (2000), 147–160.[MR]
  150. J. D. Key, T. P. McDonough, and V. C. Mavron, Partial permutation decoding for codes from finite planes, European J. Combin. 26 (2005), no. 5, 665–682.[MR]
  151. J. D. Key and J. Moori, Codes, designs and graphs from the Janko groups J1 and J2, J. Combin. Math. Combin. Comput. 40 (2002), 143–159.[MR]
  152. J. D. Key, J. Moori, and B. G. Rodrigues, On some designs and codes from primitive representations of some finite simple groups, J. Combin. Math. Combin. Comput. 45 (2003), 3–19.[MR]
  153. J. D. Key and M. J. de Resmini, Small sets of even type and codewords, J. Geom. 61 (1998), no. 1-2, 83–104.[MR]
  154. J. D. Key and F. D. Shobe, Some transitive Steiner triple systems of Bagchi and Bagchi, J. Statist. Plann. Inference 58 (1997), no. 1, 79–86.[MR]
  155. J. D. Key and F. E. Sullivan, Codes of Steiner triple and quadruple systems, Des. Codes Cryptogr. 3 (1993), no. 2, 117–125.[MR]
  156. J. D. Key and F. E. Sullivan, Steiner triple systems with many affine hyperplanes, in Proceedings of the Twenty-sixth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1995), vol. 107, 1995, pp. 105–112.[MR]
  157. Michael Kiermaier and Sascha Kurz, Maximal integral point sets in affine planes over finite fields, Discrete Math. 309 (2009), no. 13, 4564–4575.[MR]
  158. Byungchan Kim, On inequalities and linear relations for 7-core partitions, Discrete Math. 310 (2010), no. 4, 861–868.[doi]
  159. Jon-Lark Kim and Vera Pless, Designs in additive codes over GF(4), Des. Codes Cryptogr. 30 (2003), no. 2, 187–199.[MR]
  160. Jon-Lark Kim and Patrick Solé, Skew Hadamard designs and their codes, Des. Codes Cryptogr. 49 (2008), no. 1-3, 135–145.[MR]
  161. M. Klin, G. A. Jones, A. Jurisic, M. Muzychuk, and I. Ponomarenko (eds.), Algorithmic algebraic combinatorics and gröbner bases, Springer, Berlin, 2009, pp. 309.
  162. I. S. Kotsireas and C. Koukouvinos, Inequivalent hadamard matrices from orthogonal designs, in PASCO '07: Proceedings of the 2007 International Workshop on Parallel Symbolic Computation, ACM, New York, NY, USA, 2007, pp. 95–96.[doi]
  163. Ilias S. Kotsireas and Christos Koukouvinos, Constructions for Hadamard matrices of Williamson type, J. Combin. Math. Combin. Comput. 59 (2006), 17–32.[MR]
  164. Ilias S. Kotsireas and Christos Koukouvinos, Orthogonal designs via computational algebra, J. Combin. Des. 14 (2006), no. 5, 351–362.[MR]
  165. Ilias S. Kotsireas, Christos Koukouvinos, and Jennifer Seberry, Hadamard ideals and Hadamard matrices with circulant core, J. Combin. Math. Combin. Comput. 57 (2006), 47–63.[MR]
  166. Ilias S. Kotsireas, Christos Koukouvinos, and Jennifer Seberry, Hadamard ideals and Hadamard matrices with two circulant cores, European J. Combin. 27 (2006), no. 5, 658–668.[MR]
  167. C. Koukouvinos and S. Stylianou, On skew-Hadamard matrices, Discrete Math. 308 (2008), no. 13, 2723–2731.[MR]
  168. Christos Koukouvinos and Dimitris E. Simos, Improving the lower bounds on inequivalent Hadamard matrices through orthogonal designs and meta-programming techniques, Applied Numerical Mathematics, to appear (2009).
  169. István Kovács, Klavdija Kutnar, and János Ruff, Rose window graphs underlying rotary maps, Discrete Math. 310 (2010), no. 12, 1802–1811.[MR/doi]
  170. István Kovács, Aleksander Malnič, Dragan Marušič, and Štefko Miklavič, One-matching bi-Cayley graphs over abelian groups, European J. Combin. 30 (2009), no. 2, 602–616.[MR]
  171. K. Kutnar, Aleksander Malnič, Dragan Marušič, and Štefko Miklavič, The strongly distance-balanced property of the generalized Petersen graphs, Ars Math. Contemp. 2 (2009), no. 1, 41–47.
  172. Klavdija Kutnar, Aleksander Malnič, Dragan Marušič, and Štefko Miklavič, Distance-balanced graphs: Symmetry conditions, Discrete Math. 306 (2006), no. 16, 1881–1894.[MR]
  173. Klavdija Kutnar and Dragan Marušič, Hamiltonicity of vertex-transitive graphs of order 4p, European J. Combin. 29 (2008), no. 2, 423–438.[MR/arXiv]
  174. Klavdija Kutnar and Dragan Marušič, A complete classification of cubic symmetric graphs of girth 6, J. Combin. Theory Ser. B 99 (2009), no. 1, 162–184.[MR]
  175. Klavdija Kutnar, Dragan Marušič, Štefko Miklavič, and Primož Šparl, Strongly regular tri-Cayley graphs, European J. Combin. 30 (2009), no. 4, 822–832.[MR]
  176. Klavdija Kutnar and Primož Šparl, Hamilton paths and cycles in vertex-transitive graphs of order 6p, Discrete Math. 309 (2009), no. 17, 5444–5460.[MR/doi]
  177. Warwick de Launey and Richard M. Stafford, On cocyclic weighing matrices and the regular group actions of certain Paley matrices, Discrete Appl. Math. 102 (2000), no. 1-2, 63–101.[MR]
  178. Felix Lazebnik and Raymond Viglione, An infinite series of regular edge- but not vertex-transitive graphs, J. Graph Theory 41 (2002), no. 4, 249–258.[MR]
  179. Dimitri Leemans, Locally s-arc-transitive graphs related to sporadic simple groups, J. Algebra 322 (2009), no. 3, 882–892.[MR/doi]
  180. Wolfgang Lempken, Two new symmetric 2-(144,66,30) designs, Preprint.
  181. Cai Heng Li, Tian Khoon Lim, and Cheryl E. Praeger, Homogeneous factorisations of complete graphs with edge-transitive factors, J. Algebraic Combin. 29 (2009), no. 1, 107–132.[MR]
  182. Paulette Lieby, Colouring planar graphs, Discovering Mathematics with Magma, Algorithms Comput. Math., vol. 19, Springer, Berlin, 2006, pp. 315–330.[MR]
  183. Tian Khoon Lim, Edge-transitive homogeneous factorisations of complete graphs, preprint (2004), 130 pages.[arXiv]
  184. Tian Khoon Lim, Arc-transitive homogeneous factorizations and affine planes, J. Combin. Des. 14 (2006), no. 4, 290–300.[MR]
  185. Tian Khoon Lim and Cheryl E. Praeger, On generalized Paley graphs and their automorphism groups, Michigan Math. J. 58 (2009), no. 1, 293–308.[MR/arXiv]
  186. Peter Lorimer, The construction of some trivalent symmetric graphs, Ars Combin. 26 (1988), 107–114.[MR]
  187. Peter Lorimer, The construction of Tutte's 8-cage and the Conder graph, J. Graph Theory 13 (1989), no. 5, 553–557.[MR]
  188. Peter Lorimer, Embeddings of symmetric graphs in surfaces, Australas. J. Combin. 3 (1991), 31–54.[MR]
  189. Marko Lovrečič Saražin, Walter Pacco, and Andrea Previtali, Generalizing the generalized Petersen graphs, Discrete Math. 307 (2007), no. 3-5, 534–543.[MR]
  190. Aleksander Malnič, Dragan Marušič, Štefko Miklavič, and Primož Potočnik, Semisymmetric elementary abelian covers of the Möbius-Kantor graph, Discrete Math. 307 (2007), no. 17-18, 2156–2175.[MR/arXiv]
  191. Aleksander Malnič, Dragan Marušič, and Primož Potočnik, Elementary abelian covers of graphs, J. Algebraic Combin. 20 (2004), no. 1, 71–97.[MR]
  192. Aleksander Malnič, Dragan Marušič, and Primož Potočnik, On cubic graphs admitting an edge-transitive solvable group, J. Algebraic Combin. 20 (2004), no. 1, 99–113.[MR]
  193. Aleksander Malnič, Dragan Marušič, and Primož Šparl, On strongly regular bicirculants, European J. Combin. 28 (2007), no. 3, 891–900.[MR]
  194. Aleksander Malnič and Primož Potočnik, Invariant subspaces, duality, and covers of the Petersen graph, European J. Combin. 27 (2006), no. 6, 971–989.[MR]
  195. Dragan Marušič, On 2-arc-transitivity of Cayley graphs, J. Combin. Theory Ser. B 87 (2003), no. 1, 162–196.[MR]
  196. Dragan Marušič and Primož Potočnik, Bridging semisymmetric and half-arc-transitive actions on graphs, European J. Combin. 23 (2002), no. 6, 719–732.[MR]
  197. Keith E. Mellinger, Designs, Geometry, and a Golfer's Dilemma, Math. Mag. 77 (2004), no. 4, 275–282.[MR]
  198. Jamshid Moori and B. G. Rodrigues, A self-orthogonal doubly even code invariant under McL : 2, J. Combin. Theory Ser. A 110 (2005), no. 1, 53–69.[MR]
  199. Jamshid Moori and B. G. Rodrigues, Some designs and codes invariant under the simple group Co2, J. Algebra 316 (2007), no. 2, 649–661.[MR]
  200. Margaret J. Morton, Corrigendum: "Classification of 4- and 5-arc-transitive cubic graphs of small girth" [J. Austral. Math. Soc. Ser. A 50 (1991), no. 1, 138–149; MR1094065 (92e:05053)], J. Austral. Math. Soc. Ser. A 52 (1992), no. 3, 419–420.[MR]
  201. Margaret Morton, A note on arc-transitive circulants, Bull. Inst. Combin. Appl. 23 (1998), 63–68.[MR]
  202. Akihiro Munemasa and Vladimir D. Tonchev, A new quasi-symmetric 2-(56,16,6) design obtained from codes, Discrete Math. 284 (2004), no. 1-3, 231–234.[MR]
  203. Werner Nickel, Alice C. Niemeyer, Christine M. O'Keefe, Tim Penttila, and Cheryl E. Praeger, The block-transitive, point-imprimitive 2-(729,8,1) designs, Appl. Algebra Engrg. Comm. Comput. 3 (1992), no. 1, 47–61.[MR]
  204. Hiroshi Nozaki, Geometrical approach to Seidel's switching for strongly regular graphs, preprint (2009), 9 pages.[arXiv]
  205. Ju-Mok Oh, A classification of cubic s-regular graphs of order 14p, Discrete Math. 309 (2009), no. 9, 2721–2726.[MR]
  206. Ju-Mok Oh, A classification of cubic s-regular graphs of order 16p, Discrete Math. 309 (2009), no. 10, 3150–3155.[MR]
  207. Ju-Mok Oh, Arc-transitive elementary abelian covers of the Pappus graph, Discrete Math. 309 (2009), no. 23-24, 6590–6611.[MR/doi]
  208. Ken Ono, The Web of Modularity: Arithmetic of the Coefficients of Modular Forms and q-series, CBMS Regional Conference Series in Mathematics, vol. 102, Published for the Conference Board of the Mathematical Sciences, Washington, DC, 2004, pp. viii+216.[MR]
  209. Alen Orbanić, Parallel-product decomposition of edge-transitive maps, preprint (2005), 30 pages.[arXiv]
  210. Patric R. J. Östergård, Classifying subspaces of Hamming spaces, Des. Codes Cryptogr. 27 (2002), no. 3, 297–305.[MR]
  211. Michael E. O'Sullivan, Algebraic construction of sparse matrices with large girth, IEEE Trans. Inform. Theory 52 (2006), no. 2, 718–727.[MR/link]
  212. C. W. Parker, Semisymmetric cubic graphs of twice odd order, European J. Combin. 28 (2007), no. 2, 572–591.[MR]
  213. Christopher Parker and Peter Rowley, Ω-covers of graphs, Bull. London Math. Soc. 32 (2000), no. 6, 658–662.[MR]
  214. Christopher Parker and Peter Rowley, Subgroup-chain graphs, Graphs Combin. 19 (2003), no. 4, 537–545.[MR]
  215. Christopher Parker, Edward Spence, and Vladimir D. Tonchev, Designs with the symmetric difference property on 64 points and their groups, J. Combin. Theory Ser. A 67 (1994), no. 1, 23–43.[MR]
  216. Christopher Parker and Vladimir D. Tonchev, Linear codes and doubly transitive symmetric designs, Linear Algebra Appl. 226/228 (1995), 237–246.[MR]
  217. Geoffrey Pearce, Examples of rank 3 product action transitive decompositions, Des. Codes Cryptogr. 47 (2008), no. 1-3, 289–303.[MR]
  218. Manley Perkel and Cheryl E. Praeger, Polygonal graphs: New families and an approach to their analysis, in Proceedings of the Twenty-eighth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1997), vol. 124, 1997, pp. 161–173.[MR]
  219. Manley Perkel, Cheryl E. Praeger, and Richard Weiss, On narrow hexagonal graphs with a 3-homogeneous suborbit, J. Algebraic Combin. 13 (2001), no. 3, 257–273.[MR]
  220. Kevin T. Phelps, An enumeration of 1-perfect binary codes, Australas. J. Combin. 21 (2000), 287–298.[MR]
  221. Adolfo Piperno, Search space contraction in canonical labeling of graphs (preliminary version), preprint (2008).[arXiv]
  222. Wilhelm Plesken, Counting with groups and rings, J. Reine Angew. Math. 334 (1982), 40–68.[MR]
  223. Primož Potočnik, A list of 4-valent 2-arc-transitive graphs and finite faithful amalgams of index (4,2), European J. Combin. 30 (2009), no. 5, 1323–1336.[MR]
  224. Cheryl E. Praeger and Leonard H. Soicher, Low Rank Representations and Graphs for Sporadic Groups, Australian Mathematical Society Lecture Series, vol. 8, Cambridge University Press, Cambridge, 1997, pp. xii+141.[MR]
  225. E. M. Rains, N. J. A. Sloane, and John Stufken, The lattice of N-run orthogonal arrays, J. Statist. Plann. Inference 102 (2002), no. 2, 477–500.[MR]
  226. Colin Ramsay, Trades and defining sets: theoretical and computational results, PhD Thesis, University of Queensland, 1998.
  227. B. G. Rodrigues, Self-orthogonal designs and codes from the symplectic groups S4(3) and S4(4), Discrete Math. 308 (2008), no. 10, 1941–1950.[MR]
  228. Nagwa Kamal Ahmed Rostom, On the p-rank of t-designs, Master's Thesis, University of Birmingham, 1985.
  229. Gordon F. Royle and Cheryl E. Praeger, Constructing the vertex-transitive graphs of order 24, J. Symbolic Comput. 8 (1989), no. 4, 309–326.[MR]
  230. Chekad Sarami and Vladimir D. Tonchev, Cyclic quasi-symmetric designs and self-orthogonal codes of length 63, J. Statist. Plann. Inference 138 (2008), no. 1, 80–85.[MR]
  231. Stephen T. Schibell and Richard M. Stafford, Processor interconnection networks from Cayley graphs, Discrete Appl. Math. 40 (1992), no. 3, 333–357.[MR]
  232. Bernd Schmalz, t-Designs zu vorgegebener Automorphismengruppe, Bayreuth. Math. Schr. (1992), no. 41, 164.[MR]
  233. Michel Sebille, On a result of Cameron and Praeger on block-transitive point-imprimitive t-designs, Algebraic Combinatorics and Applications (Gößweinstein, 1999), Springer, Berlin, 2001, pp. 316–323.[MR]
  234. Martin J. Sharry, Partitioning sets of quintuples into designs, J. Combin. Math. Combin. Comput. 6 (1989), 67–103.[MR]
  235. Gary J. Sherman, Thomas J. Tucker, and Mark E. Walker, How Hamiltonian can a finite group be?, Arch. Math. (Basel) 57 (1991), no. 1, 1–5.[MR]
  236. Junichi Shigezumi, On 3-lattices and spherical designs, preprint (2008), 199 pages.[arXiv]
  237. Leonard H. Soicher, Computing with graphs and groups, Topics in algebraic graph theory, Encyclopedia of Mathematics and its Applications, vol. 102, Cambridge University Press, Cambridge, 2004, pp. 250–266.[MR]
  238. A. Stoimenow, Generating functions, Fibonacci numbers and rational knots, J. Algebra 310 (2007), no. 2, 491–525.[MR]
  239. Kozo Sugiyama, Seok-Hee Hong, and Atsuhiko Maeda, The puzzle layout problem, in Graph Drawing, Perugia, 2003, Springer, 2004, pp. 500-501.
  240. Yin Tan, Alexander Pott, and Tao Feng, Strongly regular graphs associated with ternary bent functions, Journal of Combinatorial Theory, Series A 117 (2010), no. 6, 668–682.
  241. Nicolas M. Thiéry, Algebraic invariants of graphs; A study based on computer exploration, SIGSAM Bulletin 34 (2000), no. 3, 9–20.
  242. V. A. Ustimenko and A. J. Woldar, An improvement on the Erdős bound for graphs of girth 16, Second International Conference on Algebra (Barnaul, 1991), Contemp. Math., vol. 184, Amer. Math. Soc., Providence, RI, 1995, pp. 419–425.[MR]
  243. Libero Verardi, Matrices, graphs and equivalence relations, Ann. Mat. Pura Appl. (4) 180 (2002), no. 4, 413–428.[MR]
  244. H. A. Verrill, Sums of squares of binomial coefficients, with applications to Picard-Fuchs equations, preprint (2004), 20 pages.[arXiv]
  245. Paul van Wamelen, Enumerating Motzkin-Rabin geometries, J. Combin. Des. 15 (2007), no. 3, 179–194.[MR]
  246. Xiuyun Wang and Yan-Quan Feng, Hexavalent half-arc-transitive graphs of order 4p, European J. Combin. 30 (2009), no. 5, 1263–1270.[MR]
  247. Yan Wang, Xin Gui Fang, and D. F. Hsu, On the edge-forwarding indices of Frobenius graphs, Acta Math. Sin. (Engl. Ser.) 22 (2006), no. 6, 1735–1744.[MR/link]
  248. Richard Weiss, Presentations for (G,s)-transitive graphs of small valency, Math. Proc. Cambridge Philos. Soc. 101 (1987), no. 1, 7–20.[MR]
  249. Bruce W. Westbury, Invariant tensors and the cyclic sieving phenomenon, preprint (2010), 32 pages.[arXiv]
  250. Doug Wiedemann and Michael Zieve, Equivalence of sparse circulants: The bipartite Adam problem, preprint (2007), 20 pages.[arXiv]
  251. Pawel Wocjan, Efficient decoupling schemes with bounded controls based on Eulerian orthogonal arrays, Phy. Rev. A. 73 (2006), no. 6, 7.
  252. Andrew J. Woldar and Vasiliy A. Ustimenko, An application of group theory to extremal graph theory, Group Theory (Granville, OH, 1992), World Sci. Publishing, River Edge, NJ, 1993, pp. 293–298.[MR]
  253. Doron Zeilberger, Deconstructing the Zeilberger algorithm, J. Difference Equ. Appl. 11 (2005), no. 9, 851–856.[MR]
  254. Cui Zhang, Jin-Xin Zhou, and Yan-Quan Feng, Automorphisms of cubic Cayley graphs of order 2pq, Discrete Math. 309 (2009), no. 9, 2687–2695.[MR]
  255. Jin-Xin Zhou, Tetravalent s-transitive graphs of order 4p, Discrete Math. 309 (2009), no. 20, 6081–6086.[MR/doi]
  256. Jin-Xin Zhou and Yan-Quan Feng, Tetravalent one-regular graphs of order 2pq, J. Algebraic Combin. 29 (2009), no. 4, 457–471.[MR]
  257. Jin-Xin Zhou and Yan-Quan Feng, Cubic vertex-transitive graphs of order 2pq, J. of Graph Theory 65 (2010), no. 4, 263–350.[doi]
  258. Jin-Xin Zhou and Yan-Quan Feng, Tetravalent s-transitive graphs of order twice a prime power, J. Aust. Math. Soc. 88 (2010), no. 2, 277–288.[doi]