<?xml version="1.0"?><rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:edm="http://www.europeana.eu/schemas/edm/" xmlns:wgs84_pos="http://www.w3.org/2003/01/geo/wgs84_pos" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:rdaGr2="http://rdvocab.info/ElementsGr2" xmlns:oai="http://www.openarchives.org/OAI/2.0/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:ore="http://www.openarchives.org/ore/terms/" xmlns:skos="http://www.w3.org/2004/02/skos/core#" xmlns:dcterms="http://purl.org/dc/terms/"><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-4JS5ZFB6/2003bb1c-1531-4517-bb37-9f927ca99d63/PDF"><dcterms:extent>345 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-4JS5ZFB6/e4f70605-b0e2-4f91-bb24-b15abf25485d/TEXT"><dcterms:extent>35 KB</dcterms:extent></edm:WebResource><edm:TimeSpan rdf:about="2008-2025"><edm:begin xml:lang="en">2008</edm:begin><edm:end xml:lang="en">2025</edm:end></edm:TimeSpan><edm:ProvidedCHO rdf:about="URN:NBN:SI:doc-4JS5ZFB6"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR" /><dcterms:issued>2021</dcterms:issued><dc:creator>Anand, Bijo S.</dc:creator><dc:creator>Changat, Manoj</dc:creator><dc:creator>Narasimha-Shenoi, Prasanth G.</dc:creator><dc:creator>Thottungal Joseph, Mary Shalet</dc:creator><dc:format xml:lang="sl">številka:2</dc:format><dc:format xml:lang="sl">letnik:20</dc:format><dc:format xml:lang="sl">str. 275-288</dc:format><dc:identifier>DOI:10.26493/1855-3974.2229.5f1</dc:identifier><dc:identifier>ISSN:1855-3966</dc:identifier><dc:identifier>COBISSID_HOST:92615939</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-4JS5ZFB6</dc:identifier><dc:language>en</dc:language><dc:publisher xml:lang="sl">Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije</dc:publisher><dcterms:isPartOf xml:lang="sl">Ars mathematica contemporanea</dcterms:isPartOf><dc:subject xml:lang="en">boundary-type sets</dc:subject><dc:subject xml:lang="sl">krepki produkt</dc:subject><dc:subject xml:lang="sl">krepko povezan digraf</dc:subject><dc:subject xml:lang="en">maximum distance</dc:subject><dc:subject xml:lang="sl">množice različnih tipov robov</dc:subject><dc:subject xml:lang="sl">največja razdalja</dc:subject><dc:subject xml:lang="en">strong product</dc:subject><dc:subject xml:lang="en">strongly connected digraph</dc:subject><dcterms:temporal rdf:resource="2008-2025" /><dc:title xml:lang="sl">Boundary-type sets of strong product of directed graphs|</dc:title><dc:description xml:lang="sl">Let ?$D=(V,E)$? be a strongly connected digraph and let ?$u ,v\in V(D)$?. The maximum distance ?$md (u,v)$? is defined as ?$md(u,v)=\max\{\overrightarrow{d}(u,v), \overrightarrow{d}(v,u)\}$? where ?$\overrightarrow{d}(u,v)$? denote the length of a shortest directed ?$u-v$? path in ?$D$?. This is a metric. The boundary, contour, eccentric and peripheral sets of a strong digraph ?$D$? with respect to this metric have been defined, and the above said metrically defined sets of a large strong digraph ?$D$? have been investigated in terms of the factors in its prime factor decomposition with respect to Cartesian product. In this paper we investigate about the above boundary-type sets of a strong digraph ?$D$? in terms of the factors in its prime factor decomposition with respect to strong product</dc:description><dc:description xml:lang="sl">Naj bo ?$D=(V,E)$? krepko povezan digraf in naj bosta ?$u$? in ?$v$? dve vozlišči v ?$D$?. Maksimalna razdalja ?$md (u,v)$? je definirana kot ?$md(u,v)=\max\{\overrightarrow{d}(u,v), \overrightarrow{d}(v,u)\}$?, kjer ?$\overrightarrow{d}(u,v)$? označuje dolžino najkrajše usmerjene ?$u-v$? poti v ?$D$?. To je metrika. Definiramo robno, konturno, ekscentričnostno in periferno množice krepko povezanega digrafa ?$D$? glede na to metriko. V tem članku raziskujemo množice različnih tipov robov krepkega produkta dveh digrafov</dc:description><edm:type>TEXT</edm:type><dc:type xml:lang="sl">znanstveno časopisje</dc:type><dc:type xml:lang="en">journals</dc:type><dc:type rdf:resource="http://www.wikidata.org/entity/Q361785" /></edm:ProvidedCHO><ore:Aggregation rdf:about="http://www.dlib.si/?URN=URN:NBN:SI:doc-4JS5ZFB6"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-4JS5ZFB6" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-4JS5ZFB6/2003bb1c-1531-4517-bb37-9f927ca99d63/PDF" /><edm:rights rdf:resource="http://creativecommons.org/licenses/by/4.0/" /><edm:provider>Slovenian National E-content Aggregator</edm:provider><edm:intermediateProvider xml:lang="en">National and University Library of Slovenia</edm:intermediateProvider><edm:dataProvider xml:lang="sl">Univerza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije</edm:dataProvider><edm:object rdf:resource="http://www.dlib.si/streamdb/URN:NBN:SI:doc-4JS5ZFB6/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-4JS5ZFB6" /></ore:Aggregation></rdf:RDF>