Links between two semisymmetric graphs on 112 vertices via association schemes

Journal of Symbolic Computation

Volumn 47, Issue 10, 2012, Pages 1175-1191

  Klin, Mikhail ^a   Lauri, Josef ^b   Ziv Av, Matan ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b UNIVERSITY OF MALTA   (Malta)

Author keywords

Association scheme; Computer algebra; Dejter graph; Deza graph; Double cover; Ljubljana graph; Nikolaev graph; Overlarge set of designs; Semisymmetric graph

Indexed keywords

EID: 84861532155     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2011.12.040     Document Type: Article

References (61)

1. Babai L. The forbidden sidetrip. Springer Ser. Discrete Math. Theor. Comput. Sci. 1999, 1-31. Springer, Singapore.
2. Bannai E., Ito T. Algebraic Combinatorics. I. Association Schemes 1984, The Benjamin/Cummings Publishing Co. Inc., Menlo Park, CA, xxiv+425 pp. ISBN: 0-8053-0490-8, 05-01.
3. Betten D. Geometrische Permutationsgruppen. Mitt. Math. Ges. Hamburg 1977, 10(5):317-324.
4. Biggs N. Algebraic Graph Theory 1993, Cambridge Mathematical Library. Cambridge University Press, Cambridge. 2nd edition.
5. Borges J., Dejter I.J. On perfect dominating sets in hypercubes and their complements. J. Combin. Math. Combin. Comput. 1996, 20:161-173.
6. Bouwer I.Z. An edge but not vertex transitive cubic graph. Canad. Math. Bull. 1968, 11:533-535.
7. Brouwer A.E., Cohen A.M., Neumaier A. Distance-regular graphs. Ergebnisse der Mathematik und ihrer Grenzgebiete (3) [Results in Mathematics and Related Areas (3)] 1989, vol. 18. Springer-Verlag, Berlin.
8. Brouwer A.E., Ivanov A.V., Klin M.H. Some new strongly regular graphs. Combinatorica 1989, 9(4):339-344. URL: http://dx.doi.org/10.1007/BF02125346.
9. Brouwer A.E., Dejter I.J., Thomassen C. Highly symmetric subgraphs of hypercubes. J. Algebraic Combin. 1993, 2(1):25-29. URL: http://dx.doi.org/10.1023/A:1022472513494.
10. Cameron P.J. Permutation groups. London Mathematical Society Student Texts 1999, vol. 45. Cambridge University Press, Cambridge, URL: http://dx.doi.org/10.1017/CBO9780511623677.
11. Colbourn C.J., Rosa A. Triple systems. Oxford Mathematical Monographs 1999, The Clarendon Press Oxford University Press, New York.
12. Conder M., Malnič A., Marušič D., Pisanski T., Potočnik P. The edge-transitive but not vertex-transitive cubic graph on 112 vertices. J. Graph Theory 2005, 50(1):25-42. URL: http://dx.doi.org/10.1002/jgt.20089.
13. Conder M., Malnič A., Marušič D., Potočnik P. A census of semisymmetric cubic graphs on up to 768 vertices. J. Algebraic Combin. 2006, 23(3):255-294. URL: http://dx.doi.org/10.1007/s10801-006-7397-3.
14. Coxeter H.S.M. Self-dual configurations and regular graphs. Bull. Amer. Math. Soc. 1950, 56:413-455.
15. Dejter I.J. On symmetric subgraphs of the 7-cube: an overview. Discrete Math. 1994, 124(1-3):55-66. Graphs and combinatorics (Qawra, 1990). URL: http://dx.doi.org/10.1016/0012-365X(92)00128-E.
16. Dejter I.J. Symmetry of factors of the 7-cube Hamming shell. J. Combin. Des. 1997, 5(4):301-309. URL: http://dx.doi.org/10.1002/(SICI)1520-6610(1997)5:4<301::AID-JCD5>3.3.CO;2-B.
17. Dejter I.J., Guan P. Square-blocking edge subsets in hypercubes and vertex avoidance. Graph Theory, Combinatorics, Algorithms, and Applications (San Francisco, CA, 1989) 1991, 162-174. SIAM, Philadelphia, PA.
18. Dejter, I.J., Pujol, J., 1995. Perfect domination and symmetry in hypercubes. In: Proceedings of the Twenty-sixth Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, vol. 111, pp. 18-32.
19. Dejter, I.J., Weichsel, P.M., 1993. Twisted perfect dominating subgraphs of hypercubes. In: Proceedings of the Twenty-fourth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL, vol.94, pp. 67-78.
20. Deza A., Deza M. The ridge graph of the metric polytope and some relatives. NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci. 1994, vol. 440:359-372. Kluwer Acad. Publ., Dordrecht.
21. Dixon J.D., Mortimer B. Permutation groups. Graduate Texts in Mathematics 1996, vol. 163. Springer-Verlag, New York.
22. Erickson M., Fernando S., Haemers W.H., Hardy D., Hemmeter J. Deza graphs: a generalization of strongly regular graphs. J. Combin. Des. 1999, 7(6):395-405. URL: http://dx.doi.org/10.1002/(SICI)1520-6610(1999)7:6<395::AID-JCD1>3.3.CO;2-L.
23. Faradžev I.A., Ivanov A.A., Klin M.H. Galois correspondence between permutation groups and cellular rings (association schemes). Graphs Combin. 1990, 6(4):303-332. URL: http://dx.doi.org/10.1007/BF01787700.
24. Faradžev I.A., Klin M.H. Computer package for computations with coherent configurations. Proc. ISSAC 1991, 219-223. ACM Press, Bonn.
25. Faradžev I.A., Klin M.H., Muzichuk M.E. Cellular rings and groups of automorphisms of graphs. Math. Appl. (Soviet Ser.) 1994, vol. 84:1-152. Kluwer Acad. Publ, Dordrecht.
26. Folkman J. Regular line-symmetric graphs. J. Combin. Theory 1967, 3:215-232.
27. GAP, 2008. GAP-Groups, Algorithms, and Programming, Version 4.4.12. The GAPGroup. URL: . http://www.gap-system.org.
28. Godsil C., Royle G. Algebraic graph theory. Graduate Texts in Mathematics 2001, vol. 207. Springer-Verlag, New York.
29. Harary F. Graph Theory 1969, Addison-Wesley Publishing Co, Reading, Mass.-Menlo Park, Calif.-London.
30. Higman D.G. Coherent configurations. I. Rend. Sem. Mat. Univ. Padova 1970, 44:1-25.
31. Higman D.G. Coherent algebras. Linear Algebra Appl. 1987, 93:209-239. URL: http://dx.doi.org/10.1016/S0024-3795(87)90326-0.
32. Higman D.G. Rank 5 association schemes and triality. Linear Algebra Appl. 1995, 226/228:197-222. URL: http://dx.doi.org/10.1016/0024-3795(95)00102-W.
33. Holt D.F. A graph which is edge transitive but not arc transitive. J. Graph Theory 1981, 5(2):201-204. URL: http://dx.doi.org/10.1002/jgt.3190050210.
34. Ivanov A.A. Computation of lengths of orbits of a subgroup in a transitive permutation group. Math. Appl. (Soviet Ser.) 1994, vol. 84:275-282. Kluwer Acad. Publ, Dordrecht.
35. Ivanov A.A., Iofinova M.E. Biprimitive cubic graphs. Investigations in the algebraic theory of combinatorial objects (Russian) 1985, 123-134. Vsesoyuz. Nauchno-Issled. Inst. Sistem. Issled, Moscow.
36. Ivanov A.V. On edge but not vertex transitive regular graphs. North-Holland Math. Stud 1987, vol. 149:273-285. North-Holland, Amsterdam, URL: http://dx.doi.org/10.1016/S0304-0208(08)72893-7.
37. Klin, M., 1974. Investigation of relational algebras invariant under the action of certain classes of permutation groups, Ph.D. Thesis.
38. Klin M.H. Examination on the MIR-1 computer of exclusive cases in the problem of maximality of induced symmetric groups. Computations in Algebra and Combinatorial Analysis (Russian) 1978, 54-72. Akad. Nauk Ukrain. SSR Inst. Kibernet, Kiev.
39. Klin M.H. On edge but not vertex transitive graphs. Math. Soc. János Bolyai 1981, vol. 25:399-403. North-Holland, Amsterdam.
40. Klin M., Muzychuk M., Pech C., Woldar A., Zieschang P.-H. Association schemes on 28 points as mergings of a half-homogeneous coherent configuration. European J. Combin. 2007, 28(7):1994-2025. URL: http://dx.doi.org/10.1016/j.ejc.2006.08.010.
41. Klin M., Muzychuk M., Ziv-Av M. Higmanian rank-5 association schemes on 40 points. Michigan Math. J. 2009, 58(1):255-284. URL: http://dx.doi.org/10.1307/mmj/1242071692.
42. Klin M., Reichard S., Woldar A. Siamese combinatorial objects via computer algebra experimentation. Algorithmic Algebraic Combinatorics and Gröbner Bases 2009, 67-112. Springer, Berlin, URL: http://dx.doi.org/10.1007/978-3-642-01960-9_2.
43. Klin M., Pech C., Reichard S., Woldar A., Ziv-Av M. Examples of computer experimentation in algebraic combinatorics. Ars Math. Contemp. 2010, 3:237-258.
44. Klin, M., Reichard, S., Woldar, A., On a simple group of order 504, its automorphism group and related combinatorial structures (in preparation).
45. Klin, M.C., Pöschel, R., Rosenbaum, K., 1988. Angewandte Algebra für Mathematiker und Informatiker. VEB Deutscher Verlag der Wissenschaften, Berlin, einführung in gruppentheoretisch-kombinatorische Methoden. [Introduction to group-theoretical combinatorial methods].
46. Klin, M.H., Lauri, J., Ziv-Av, M., 2011. Links between two semisymmetric graphs on 112 vertices through the lens of association schemes, preprint.
47. Lauri J., Mizzi R., Scapellato R. Two-fold orbital digraphs and other constructions. Int. J. Pure Appl. Math. Sci. 2004, 1:63-93.
48. Lauri J., Mizzi R., Scapellato R. Two-fold automorphisms of graphs. Australas. J. Combin. 2011, 49:165-176.
49. Lauri J., Scapellato R. Topics in graph automorphisms and reconstruction. London Mathematical Society Student Texts 2003, vol. 54. Cambridge University Press, Cambridge.
50. LJU, 2010. The ljubljana graph. URL: . http://en.wikipedia.org/wiki/Ljubljana_graph.
51. Marušič D., Pisanski T. The Gray graph revisited. J. Graph Theory 2000, 35(1):1-7. URL: http://dx.doi.org/10.1002/1097-0118(200009)35:1<1::AID-JGT1>3.0.CO;2-7.
52. Marušič D., Scapellato R., Zagaglia Salvi N. A characterization of particular symmetric (0, 1) matrices. Linear Algebra Appl. 1989, 119:153-162. URL: http://dx.doi.org/10.1016/0024-3795(89)90075-X.
53. McKay B.D. Nauty User's Guide (version 1.5) 1990.
54. Sharry M.J., Street A.P. Partitioning sets of triples into designs. Ars Combin. 1988, 26(B):51-66.
55. Sims C.C. Computational methods in the study of permutation groups. Computational Problems in Abstract Algebra, Proc. Conf., Oxford, 1967 1970, 169-183. Pergamon, Oxford.
56. Soicher L.H. GRAPE: a system for computing with graphs and groups. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 1993, vol. 11:287-291. Amer. Math. Soc., Providence, RI.
57. Weisstein, E.W., 2010. Doyle graph. URL: . http://mathworld.wolfram.com/DoyleGraph.html/.
58. Wielandt, H., 1969. Permutation groups through invariant relations and invariant functions. Ohio State University, Columbus.
59. Zelinka B. Isotopy of digraphs. Czechoslovak Math. J. 1972, 22(97):353-360.
60. Zelinka B. On double covers of graphs. Math. Slovaca 1982, 32(1):49-54.
61. Zelinka B. Double covers and logics of graphs. Czechoslovak Math. J. 1983, 33(108)(3):354-360.