Gordon F. Royle
- Holt D. (1985). The Mechanical Computation of First and Second Cohomology Groups. Journal of Symbolic Computation, 1, 351-361. Google Scholar
Digital Library
- McKay B.D. (1981). Practical graph isomorphism. Proceedings of the 10th Manitoba Conference on Numerical Maths and Computing. Congressus Numerantium 30, 45-87.Google Scholar
- Praeger C.E. and Royle G.F. (1989). Constructing the vertex-transitive graphs of order 24. Journal of Symbolic Computation, 8, 309-326. Google ScholarDigital Library
- Royle G. F. (1987). The transitive groups of degree twelve. Journal of Symbolic Computation , 4, 255-268. Google ScholarDigital Library
Index Terms
- Constructing the vertex-transitive graphs on 24 vertices
Recommendations
Connectivity of vertex and edge transitive graphs
A graph is said to be super-connected if every minimum vertex cut isolates a vertex. A graph is said to be hyper-connected if each minimum vertex cut creates exactly two components, one of which is an isolated vertex. It is proved that a connected ...
3-Factor-Criticality of Vertex-Transitive Graphs
A graph of order n is p -factor-critical, where p is an integer of the same parity as n, if the removal of any set of p vertices results in a graph with a perfect matching. 1-factor-critical graphs and 2-factor-critical graphs are factor-critical graphs ...
Vertex-transitive CIS graphs
A CIS graph is a graph in which every maximal stable set and every maximal clique intersect. A graph is well-covered if all its maximal stable sets are of the same size, co-well-covered if its complement is well-covered, and vertex-transitive if, for ...
Comments