<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-G3YP01PE</identifier><date>2015</date><creator>Östergard, Patric R. J.</creator><creator>Shao, Zehui</creator><creator>Xu, Xiaodong</creator><relation>documents/doc/G/URN_NBN_SI_doc-G3YP01PE_001.pdf</relation><relation>documents/doc/G/URN_NBN_SI_doc-G3YP01PE_001.txt</relation><format format_type="issue">2</format><format format_type="volume">9</format><format format_type="type">article</format><format format_type="extent">str. 187-195</format><identifier identifier_type="COBISSID">17588825</identifier><identifier identifier_type="ISSN">1855-3966</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-G3YP01PE</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">dominating set</subject><subject language_type_id="eng">domination number</subject><subject language_type_id="slv">dominirajoča množica</subject><subject language_type_id="slv">dominirajoče število</subject><subject language_type_id="eng">Kneser graph</subject><subject language_type_id="slv">Kneserjev graf</subject><title>Bounds on the domination number of Kneser graphs</title></Record>