A census of semisymmetric cubic graphs on up to 768 vertices - download pdf or read online

By Conder M., Malniс A.

Show description

Read or Download A census of semisymmetric cubic graphs on up to 768 vertices PDF

Best graph theory books

Get Graph theory and combinatorial optimization PDF

Graph thought is especially a lot tied to the geometric homes of optimization and combinatorial optimization. in addition, graph theory's geometric houses are on the middle of many learn pursuits in operations learn and utilized arithmetic. Its suggestions were utilized in fixing many classical difficulties together with greatest circulate difficulties, self sustaining set difficulties, and the touring salesman challenge.

Get An Algorithmic Theory of Numbers, Graphs and Convexity PDF

A examine of the way complexity questions in computing engage with classical arithmetic within the numerical research of matters in set of rules layout. Algorithmic designers fascinated by linear and nonlinear combinatorial optimization will locate this quantity specifically invaluable. algorithms are studied intimately: the ellipsoid technique and the simultaneous diophantine approximation strategy.

Additional info for A census of semisymmetric cubic graphs on up to 768 vertices

Sample text

Conder and P. Lorimer, “Automorphism Groups of Symmetric Graphs of Valency 3,” J. Combin. Theory, Series B 47 (1989), 60–72. 6. E. Conder, P. Dobcs´anyi, B. Mc Kay and G. au/~gordon/remote/foster/. 7. E. Conder and P. Dobcs´anyi, “Trivalent symmetric graphs on up to 768 vertices,” J. Combin. Math. Combin. Comput. 40 (2002), 41–63. 8. E. Conder, A. Malniˇc, D. Maruˇsiˇc, T. Pisanski and P. Potoˇcnik, “The edge-transitive but not vertextransitive cubic graph on 112 vertices”, J. Graph Theory 50 (2005), 25–42.

Combin. 22 (2001), 333–349. ˇ 36. M. Skoviera, “A contribution to the theory of voltage graphs,” Discrete Math. 61 (1986), 281–292. 37. T. Tutte, “A family of cubical graphs,” Proc. Cambridge Phil. Soc. 43 (1948), 459–474. 38. H. Wielandt, Finite Permutation Groups, Academic Press, New York-London, 1964. 39. E. Wilson, “A worthy family of semisymmetric graphs”, DiscreteMath. 271 (2003), 283–294.

Theory, Series B 47 (1989), 60–72. 6. E. Conder, P. Dobcs´anyi, B. Mc Kay and G. au/~gordon/remote/foster/. 7. E. Conder and P. Dobcs´anyi, “Trivalent symmetric graphs on up to 768 vertices,” J. Combin. Math. Combin. Comput. 40 (2002), 41–63. 8. E. Conder, A. Malniˇc, D. Maruˇsiˇc, T. Pisanski and P. Potoˇcnik, “The edge-transitive but not vertextransitive cubic graph on 112 vertices”, J. Graph Theory 50 (2005), 25–42. 9. H. T. P. A. A. Wilson, Atlas of finite groups, Oxford University Press, Eynsham, 1985.

Download PDF sample

A census of semisymmetric cubic graphs on up to 768 vertices by Conder M., Malniс A.


by Robert
4.2

Rated 4.70 of 5 – based on 48 votes