<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>A census of Cayley graphs</dc:title><dc:creator>Evans,	Rhys J.	(Avtor)
	</dc:creator><dc:creator>Potočnik,	Primož	(Avtor)
	</dc:creator><dc:subject>Cayley graphs</dc:subject><dc:subject>enumeration</dc:subject><dc:subject>cubic graphs</dc:subject><dc:subject>quartic graphs</dc:subject><dc:description>Given positive integers $k$ and $n$, we present methods to construct all groups of order at most $n$ that contain a Cayley set of size $k$, and to enumerate the Cayley sets of order $k$ in a given group, up to the action of the automorphism group. We use these methods to generate complete lists of pairwise nonisomorphic $3$-valent Cayley graphs with at most 5,000 vertices and $4$-valent Cayley graphs with at most 1,025 vertices.</dc:description><dc:date>2026</dc:date><dc:date>2026-04-08 08:50:06</dc:date><dc:type>Neznano</dc:type><dc:identifier>28797</dc:identifier><dc:identifier>UDK: 512:519.17</dc:identifier><dc:identifier>ISSN pri članku: 0747-7171</dc:identifier><dc:identifier>DOI: 10.1016/j.jsc.2026.102580</dc:identifier><dc:identifier>COBISS_ID: 274459395</dc:identifier><dc:language>sl</dc:language></metadata>
