By Conder M., Malniс A.
Read or Download A census of semisymmetric cubic graphs on up to 768 vertices PDF
Best graph theory books
Combinatorics has no longer been a longtime department of arithmetic for terribly lengthy: the final sector of a century has obvious an explosive progress within the topic. This development has been mostly a result of doyen of combinatorialists, Paul Erdos, whose penetrating perception and insatiable interest has supplied an enormous stimulus for staff within the box.
Geometry in historic Greece is related to have originated within the interest of mathematicians concerning the shapes of crystals, with that interest culminating within the class of normal convex polyhedra addressed within the ultimate quantity of Euclid’s components. considering then, geometry has taken its personal direction and the learn of crystals has now not been a valuable topic in arithmetic, aside from Kepler’s paintings on snowflakes.
One of many nice mysteries of the human brain is its strength to create new sorts of wisdom. Arthur I. Miller is a historian of technological know-how whose technique has been strongly motivated by way of present paintings in cognitive technology, and during this booklet he exhibits how the 2 fields should be fruitfully associated with yield new insights into the inventive strategy.
Graph concept is a crucial department of up to date combinatorial arithmetic. by means of describing contemporary leads to algebraic graph thought and demonstrating how linear algebra can be utilized to take on graph-theoretical difficulties, the authors offer new ideas for experts in graph idea. The ebook explains how the spectral conception of finite graphs will be reinforced via exploiting houses of the eigenspaces of adjacency matrices linked to a graph.
- Computational Structural Analysis and Finite Element Methods
- Scientific Visualization: Uncertainty, Multifield, Biomedical, and Scalable Visualization
- Spectral Graph Theory
- Aperiodic layers
Additional info for A census of semisymmetric cubic graphs on up to 768 vertices
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. 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.
19. C. Godsil and G. Royle, Algebraic Graph Theory, Graduate Texts in Mathematics 207, Springer-Verlag, New York, 2001. 20. D. Goldschmidt, “Automorphisms of trivalent graphs,” Ann. Math. 111 (1980), 377–406. 21. D. Gorenstein, Finite Groups, Harper and Row, New York, 1968. 22. D. Gorenstein, Finite Simple Groups: An Introduction To Their Classification, Plenum Press, New York, 1982. 23. L. W. Tucker, Topological Graph Theory, Wiley–Interscience, New York, 1987. 24. E. A. Ivanov, Biprimitive cubic graphs, Investigations in Algebraic Theory of Combinatorial Objects (Proceedings of the seminar, Institute for System Studies, Moscow, 1985) Kluwer Academic Publishers, London, 1994, pp 459–472.
9 (1999), 151–156. 14. F. Y. Xu, “A classification of semisymmetric graphs of order 2 pq (I),” Comm. Algebra 28 (2000), 2685–2715. J. Combin. Theory, Series B 29 (1980), 195–230. 15. J. Folkman, “Regular line-symmetric graphs,” J. Combin. Theory 3 (1967), 215–232. 16. R. Frucht, “A canonical representation of trivalent Hamiltonian graphs,” J. Graph Theory 1 (1977), 45–60. 17. M. H. E. Praeger, “Characterising finite locally s–arc transitive graphs with a star normal quotient,” preprint. 18. C. Godsil, “On the full automorphism group of Cayley graphs,” Combinatorica 1 (1981), 143–156.