<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.upr.si/IzpisGradiva.php?id=21711"><dc:title>The Gray graph is a unit-distance graph</dc:title><dc:creator>Berman,	Leah	(Avtor)
	</dc:creator><dc:creator>Gévay,	Gábor	(Avtor)
	</dc:creator><dc:creator>Pisanski,	Tomaž	(Avtor)
	</dc:creator><dc:subject>polycirculant</dc:subject><dc:subject>unit-distance graph</dc:subject><dc:subject>Gray graph</dc:subject><dc:subject>ADAM graph</dc:subject><dc:subject>generalized Petersen graph</dc:subject><dc:description>In this note we give a construction proving that the Gray graph, which is the smallestcubic semisymmetric graph, is a unit-distance graph.</dc:description><dc:publisher>Založba Univerze na Primorskem</dc:publisher><dc:date>2025</dc:date><dc:date>2025-09-10 14:12:40</dc:date><dc:type>Neznano</dc:type><dc:identifier>21711</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>