G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs
暂无分享,去创建一个
[1] J. Folkman. Regular line-symmetric graphs , 1967 .
[2] Alain Bretto,et al. Symmetric and semisymmetric graphs construction using G-graphs , 2005, ISSAC '05.
[3] Ming-Yao Xu,et al. A classification of semisymmetric graphs of order 2pq , 2000 .
[4] D. Robinson. A Course in the Theory of Groups , 1982 .
[5] Ming Yao Xu,et al. Note on Infinite Families of Trivalent Semisymmetric Graphs , 2002, Eur. J. Comb..
[6] Alain Bretto,et al. Another way for associating a graph to a group , 2005 .
[7] Dragan Marusic,et al. Constructing cubic edge- but not vertex-transitive graphs , 2000, J. Graph Theory.
[8] Alain Bretto,et al. G-graphs: A new representation of groups , 2007, J. Symb. Comput..
[9] Josef Lauri,et al. Constructing graphs with several pseudosimilar vertices or edges , 2003, Discret. Math..
[10] L. Babai. Automorphism groups, isomorphism, reconstruction , 1996 .
[11] Dragan Maru i. Constructing cubic edge- but not vertex-transitive graphs , 2000 .
[12] Gene Cooperman,et al. Applications of Cayley Graphs , 1990, AAECC.
[13] M. Conder,et al. A census of semisymmetric cubic graphs on up to 768 vertices , 2006 .
[14] Alain Bretto,et al. Graphical and Computational Representation of Groups , 2004, International Conference on Computational Science.
[15] J. Lauri,et al. Topics in Graph Automorphisms and Reconstruction , 2003 .
[16] R. Graham,et al. Handbook of Combinatorics , 1995 .