Constructive enumeration of graphs

DOI10.1017/S0004972700027398zbMath0633.05034OpenAlexW2091829451MaRDI QIDQ3770567

Gordon F. Royle

Publication date: 1988

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972700027398

zbMATH Keywords

algorithmCayley graphscubic graphsvertex-transitive graphsconstructionCAYLEYnumerical informationgroup theoretic software

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (3)

Further restrictions on the structure of finite DCI-groups: an addendum ⋮ Non-Abelian finite groups whose character sums are invariant but are not Cayley isomorphism ⋮ Further restrictions on the structure of finite CI-groups

This page was built for publication: Constructive enumeration of graphs