<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:DOC-0X8PGKTF</identifier><date>2025</date><creator>Berman, Leah</creator><creator>Gévay, Gábor</creator><creator>Pisanski, Tomaž</creator><relation>documents/doc/0/URN_NBN_SI_doc-0X8PGKTF_001.pdf</relation><relation>documents/doc/0/URN_NBN_SI_doc-0X8PGKTF_001.txt</relation><relation>documents/doc/0/URN_NBN_SI_doc-0X8PGKTF_002.pdf</relation><format format_type="issue">1, article  p1.03</format><format format_type="volume">8</format><format format_type="type">article</format><format format_type="extent">str. 1-7</format><identifier identifier_type="DOI">10.26493/2590-9770.1747.65c</identifier><identifier identifier_type="COBISSID_HOST">234384131</identifier><identifier identifier_type="ISSN">2590-9770</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-0X8PGKTF</identifier><language>eng</language><publisher publisher_location="Koper">Fakulteta za matematiko, naravoslovje in informacijske tehnologije</publisher><source>The art of discrete and applied mathematics</source><rights>BY</rights><subject language_type_id="eng">ADAM graph</subject><subject language_type_id="slv">ADAM-ov graf</subject><subject language_type_id="eng">generalized Petersen graph</subject><subject language_type_id="slv">graf enotskih razdalj</subject><subject language_type_id="eng">Gray graph</subject><subject language_type_id="slv">Grayjev graf</subject><subject language_type_id="slv">policirkulant</subject><subject language_type_id="eng">polycirculant</subject><subject language_type_id="slv">posplošen Petersenov graf</subject><subject language_type_id="eng">unit-distance graph</subject><title>The Gray graph is a unit-distance graph</title></Record>