By Conder M., Malniс A.
Read or Download A census of semisymmetric cubic graphs on up to 768 vertices PDF
Similar graph theory books
The purpose of this e-book is to settle the principles of non-linear computational geometry. It covers combinatorial information constructions and algorithms, algebraic matters in geometric computing, approximation of curves and surfaces, and computational topology. each one bankruptcy presents a state-of-the-art, in addition to an educational advent to special ideas and effects.
This ebook offers for the 1st time the idea of the moir? phenomenon among aperiodic or random layers. The booklet offers a whole normal goal and application-independent exposition of the topic. in the course of the complete textual content the publication favours a pictorial, intuitive method that's supported via arithmetic, and the dialogue is observed by means of plenty of figures and illustrative examples.
This e-book is ready graph strength. The authors have integrated some of the very important effects on graph power, resembling the entire method to the conjecture on maximal power of unicyclic graphs, the Wagner-Heuberger’s end result at the strength of timber, the strength of random graphs or the method of strength utilizing singular values.
This e-book is the 1st and just one of its sort with regards to law enforcement officials and Robbers video games, and extra often, at the box of vertex pursuit video games on graphs. The booklet is written in a full of life and hugely readable style, which may still attract either senior undergraduates and specialists within the box (and each person in between).
- Problems in Combinatorics and Graph Theory
- Introduction to graph theory
- A Beginner’s Guide to Graph Theory
- Topological crystallography : with a view towards discrete geometric analysis
- Introduction to Enumerative Combinatorics (Walter Rudin Student Series in Advanced Mathematics)
- 1/2-Transitive Graphs of Order 3p
Additional info for A census of semisymmetric cubic graphs on up to 768 vertices
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. 10. D. Dixon and B. Mortimer, Permutation Groups, Springer–Verlag, New York, 1996.
9. H. T. P. A. A. Wilson, Atlas of finite groups, Oxford University Press, Eynsham, 1985. 10. D. Dixon and B. Mortimer, Permutation Groups, Springer–Verlag, New York, 1996. L. Miller, “Regular groups of automorphisms of cubic graphs,” J. Combin. Theory. 11. Z. B 29 (1980), 195–230. 12. P. nz/~peter. Springer 294 J Algebr Comb (2006) 23: 255–294 13. F. Du and D. Maruˇsiˇc, “Biprimitive graphs of smallest order,” J. Algebraic Combin. 9 (1999), 151–156. 14. F. Y. Xu, “A classification of semisymmetric graphs of order 2 pq (I),” Comm.
A. Malniˇc, D. Maruˇsiˇc and P. Potoˇcnik, “Elementary abelian covers of graphs”, J. Algebraic Combinatorics 20 (2004), 71–97. ˇ 32. A. Malniˇc, R. Nedela, and M. Skoviera, “Lifting graph automorphisms by voltage assignments,” European J. Combin. 21 (2000), 927–947. 33. D. Maruˇsiˇc, “Constructing cubic edge- but not vertex-transitive graphs,” J. Graph Theory 35 (2000), 152–160. 34. D. Maruˇsiˇc and T. Pisanski, “The Gray graph revisited,” J. Graph Theory 35 (2000), 1–7. 35. D. Maruˇsiˇc and P.