Transitive Graphs With Fewer Than Twenty Vertices

From MaRDI portal
Publication:4198797

DOI10.2307/2006085zbMath0411.05046OpenAlexW4251314885MaRDI QIDQ4198797

Brendan D. McKay

Publication date: 1979

Full work available at URL: https://doi.org/10.2307/2006085



Related Items

Pentavalent symmetric graphs of order twice a prime power, Tetravalent one-regular graphs of order \(2pq\), Cubic non-Cayley vertex-transitive bi-Cayley graphs over a regular \(p\)-group, Cubic vertex-transitive non-Cayley graphs of order \(12p\), Pentavalent symmetric graphs of order \(2p^3\), Super-cyclically edge-connected regular graphs, Proper distinguishing colorings with few colors for graphs with girth at least 5, Regular maps of graphs of order \(4p\), Tetravalent half-transitive graphs of order \(4p\), Feasibility conditions for the existence of walk-regular graphs, Constructing the vertex-transitive graphs of order 24, Pentavalent symmetric graphs of order \(2pq\), Tetravalent edge-transitive graphs of order \(p^2q\), Algorithms for computing parameters of graph-based extensions of BCH codes, TETRAVALENT s-TRANSITIVE GRAPHS OF ORDER TWICE A PRIME POWER, Hamiltonicity of vertex-transitive graphs of order 4\(p\), Tetravalent vertex‐transitive graphs of order 4p, Pentavalent symmetric graphs of order 16p, There exists no tetravalent half-arc-transitive graph of order \(2p^{2}\), Hexavalent symmetric graphs of order \(9p\), Classification of the pentavalent symmetric graphs of order \(18p\), On a class of vertex-transitive distance-regular covers of complete graphs, Unnamed Item, Tetravalent half-arc-transitive graphs of order $p^2q^2$, Tetravalent \(s\)-transitive graphs of order \(4p\), Voting fairly: Transitive maximal intersecting families of sets, Non-Cayley vertex-transitive graphs of order twice the product of two odd primes, On weakly symmetric graphs of order twice a prime



Cites Work