<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-O5XMSQF0</identifier><date>2020</date><creator>Imrich, Wilfried</creator><creator>Kalinowski, Rafał</creator><creator>Pilśniak, Monika</creator><creator>Woźniak, Mariusz</creator><relation>documents/doc/O/URN_NBN_SI_doc-O5XMSQF0_001.pdf</relation><relation>documents/doc/O/URN_NBN_SI_doc-O5XMSQF0_001.txt</relation><format format_type="issue">1</format><format format_type="volume">18</format><format format_type="type">article</format><format format_type="extent">str. 117-126</format><identifier identifier_type="ISSN">1855-3966</identifier><identifier identifier_type="COBISSID_HOST">39629315</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-O5XMSQF0</identifier><language>eng</language><publisher>Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije</publisher><source>Ars mathematica contemporanea</source><rights>BY</rights><subject language_type_id="eng">distinguishing index of a graph</subject><subject language_type_id="slv">razlikovalni indeks grafa</subject><subject language_type_id="eng">symmetry breaking</subject><subject language_type_id="slv">zlom simetrije</subject><title>The distinguishing index of connected graphs without pendant edges</title></Record>