<?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-Z5ZBX6T4/77577772-5442-443a-a07e-341398bbde66/PDF"><dcterms:extent>316 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:DOC-Z5ZBX6T4/66af2eaa-1072-4749-9711-1c164d5dc45c/TEXT"><dcterms:extent>38 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-Z5ZBX6T4"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR" /><dcterms:issued>2015</dcterms:issued><dc:creator>Erveš, Rija</dc:creator><dc:creator>Žerovnik, Janez</dc:creator><dc:format xml:lang="sl">številka:2</dc:format><dc:format xml:lang="sl">letnik:8</dc:format><dc:format xml:lang="sl">str. 245-258</dc:format><dc:identifier>COBISSID:18419478</dc:identifier><dc:identifier>ISSN:1855-3966</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-Z5ZBX6T4</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">cartesian graph bundle</dc:subject><dc:subject xml:lang="en">fault tolerance</dc:subject><dc:subject xml:lang="en">interconnection network</dc:subject><dc:subject xml:lang="sl">kartezični grafovski sveženj</dc:subject><dc:subject xml:lang="sl">mešani okvarni premer</dc:subject><dc:subject xml:lang="en">mixed fault diameter</dc:subject><dc:subject xml:lang="sl">okvarna toleranca</dc:subject><dc:subject xml:lang="sl">omrežja</dc:subject><dcterms:temporal rdf:resource="2008-2025" /><dc:title xml:lang="sl">Mixed fault diameter of Cartesian graph bundles II|</dc:title><dc:description xml:lang="sl">The mixed fault diameter ?$D_{(p, q)}(G)$? is the maximum diameter among all subgraphs obtained from graph ?$G$? by deleting ?$p$? vertices and ?$q$? edges. A graph is ?$(p, q)+$?connected if it remains connected after removal of any ?$p$? vertices and any ?$q$? edges. Let ?$F$? be a connected graph with the diameter?$D(F) &gt; 1$?, and ?$B$ be $(p, q)+$?connected graph. Upper bounds for the mixed fault diameter of Cartesian graph bundle ?$G$? with fibre ?$F$? over the base graph ?$B$? are given. We prove that if ?$q &gt; 0$?, then ?$D_{(p + 1, q)}(G) \le D(F) + D_{(p, q)}(B)$?, and if ?$q = 0$? and ?$p &gt; 0$?, then ?$D_{(p + 1, 0)}(G) \le D(F) + \max \{D_{(p, 0)}(B), D_{(p - 1, 1)}(B)\}$?</dc:description><dc:description xml:lang="sl">Mešani napačni premer ?$D_{(p, q)}(G)$? je maksimalni premer vseh podgrafov, ki jih dobimo iz grafa ?$G$? z izbrisom ?$p$? vozlišč in ?$q$? povezav. Graf je ?$(p, q)+$?povezan, če ostaja povezan po izbrisu katerihkoli ?$p$? vozlišč in katerihkoli ?$q$? povezav. Naj bo ?$F$? povezan graf s premerom ?$D(F) &gt; 1$?, in naj bo ?$B$? be ?$(p, q)+$?povezan graf. Tedaj lahko dobimo zgornje meje za mešani lažni premer kartezičnega grafovskega svežnja ?$G$? z vlaknom ?$F$? nad baznim grafom ?$B$?. Dokažemo, da če je ?$q &gt; 0$?, potem je ?$D_{(p + 1, q)}(G) \le D(F) + D_{(p, q)}(B)$?, in če je ?$q = 0$? in ?$p &gt; 0$?, potem je ?$D_{(p + 1, 0)}(G) \le D(F) + \max \{D_{(p, 0)}(B), D_{(p - 1, 1)}(B)\}$?</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-Z5ZBX6T4"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:DOC-Z5ZBX6T4" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:DOC-Z5ZBX6T4/77577772-5442-443a-a07e-341398bbde66/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-Z5ZBX6T4/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:DOC-Z5ZBX6T4" /></ore:Aggregation></rdf:RDF>