<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-E3QSAC72</identifier><date>2020</date><creator>Cavaleri, Matteo</creator><creator>Donno, Alfredo</creator><relation>documents/doc/E/URN_NBN_SI_doc-E3QSAC72_001.pdf</relation><relation>documents/doc/E/URN_NBN_SI_doc-E3QSAC72_001.txt</relation><format format_type="volume">19</format><format format_type="issue">2</format><format format_type="type">article</format><format format_type="extent">str. 311-324</format><identifier identifier_type="ISSN">1855-3974</identifier><identifier identifier_type="COBISSID_HOST">44729091</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-E3QSAC72</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">distance-balanced graph</subject><subject language_type_id="slv">popolna razdalja</subject><subject language_type_id="eng">pTS-distance-balanced graph</subject><subject language_type_id="slv">pTS-razdaljno uravnotežen graf</subject><subject language_type_id="slv">razdaljno uravnotežen graf</subject><subject language_type_id="eng">total distance</subject><subject language_type_id="slv">venčni produkt grafov</subject><subject language_type_id="eng">wreath product of graphs</subject><title>Distance-balanced graphs and travelling salesman problems</title></Record>