<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-4JS5ZFB6</identifier><date>2021</date><creator>Anand, Bijo S.</creator><creator>Changat, Manoj</creator><creator>Narasimha-Shenoi, Prasanth G.</creator><creator>Thottungal Joseph, Mary Shalet</creator><relation>documents/doc/4/URN_NBN_SI_doc-4JS5ZFB6_001.pdf</relation><relation>documents/doc/4/URN_NBN_SI_doc-4JS5ZFB6_001.txt</relation><format format_type="issue">2</format><format format_type="volume">20</format><format format_type="type">article</format><format format_type="extent">str. 275-288</format><identifier identifier_type="DOI">10.26493/1855-3974.2229.5f1</identifier><identifier identifier_type="ISSN">1855-3966</identifier><identifier identifier_type="COBISSID_HOST">92615939</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-4JS5ZFB6</identifier><language>eng</language><publisher publisher_location="Koper">Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije</publisher><source>Ars mathematica contemporanea</source><rights>BY</rights><subject language_type_id="eng">boundary-type sets</subject><subject language_type_id="slv">krepki produkt</subject><subject language_type_id="slv">krepko povezan digraf</subject><subject language_type_id="eng">maximum distance</subject><subject language_type_id="slv">množice različnih tipov robov</subject><subject language_type_id="slv">največja razdalja</subject><subject language_type_id="eng">strong product</subject><subject language_type_id="eng">strongly connected digraph</subject><title>Boundary-type sets of strong product of directed graphs</title></Record>