Download e-book for iPad: A census of semisymmetric cubic graphs on up to 768 vertices by Conder M., Malniс A.

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

Download PDF by Frithjof Dau: The Logic System of Concept Graphs with Negation: And Its

The purpose of contextual good judgment is to supply a proper idea of easy common sense, that is in response to the doctrines of techniques, decisions, and conclusions. ideas are mathematized utilizing Formal proposal research (FCA), whereas an method of the formalization of decisions and conclusions is conceptual graphs, in response to Peirce's existential graphs.

Download PDF by Joanna A. Ellis-Monaghan, Iain Moffatt: Graphs on Surfaces: Dualities, Polynomials, and Knots

Graphs on Surfaces: Dualities, Polynomials, and Knots deals an available and complete therapy of modern advancements on generalized duals of graphs on surfaces, and their purposes. The authors illustrate the interdependency among duality, medial graphs and knots; how this interdependency is mirrored in algebraic invariants of graphs and knots; and the way it may be exploited to resolve difficulties in graph and knot idea.

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

Sample text

The Foster Census, Charles Babbage Research Centre, Winnipeg, 1988. 5. E. 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.

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.

Maruˇsiˇc and P. Potoˇcnik, “On cubic graphs admitting an edge-transitive solvable group”, J. Algebraic Combinatorics 20 (2004), 99–113. 30. A. Malniˇc, D. Maruˇsiˇc, P. Q. Wang, “An infinite family of cubic edge- but not vertextransitive graphs”, Discrete Mathematics 280 (2004), 133–148. 31. 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.

Download PDF sample

Rated 4.39 of 5 – based on 23 votes