Add to ORKGV disertaciji raziskujemo povezanost in okvarne premere kartezičnih grafovskih svežnjev in kartezičnih produktov. Vpeljemo mešano povezanost in mešani okvarni premer grafa, ki posplošujeta povezanosti in okvarna premera definirana glede na eno vrsto okvarjenih elementov. Nekatere rezultate na kartezičnih grafovskih svežnjih in produktih glede na eno vrsto okvarjenih elementov posplošimo in v določenih primerih tudi izboljšamo.In dissertation we study connectivity and fault diameters of Cartesian graph products and bundles. We define mixed connectivity and mixed fault diameter of a graph, that generalize connectivity and fault diameter with respect to one type of failures. In some cases we improve results of one type of failures on Cartesian...
AbstractFault tolerance and transmission delay of networks are important concepts in network design....
AbstractThe product graph Gm*Gp of two given graphs Gm and Gp was defined by Bermond et al. [Large g...
Let ▫${mathcal{D}}^E_q(G)$▫ denote the diameter of a graph ▫$G$▫ after deleting any of its ▫$q$▫ edg...
V diplomski nalogi so v prvem poglavju zapisane osnovne definicije in lastnosti iz teorije grafov. V...
Cartesian graph bundles is a class of graphs that is a generalization of the Cartesian graph product...
AbstractLet G be a k-connected graph and Dc(G) denote the maximum diameter of G after deleting any o...
www.elsevier.com/locate/ipl The (k − 1)-fault diameter Dk(G) of a k-connected graph G is the maximum...
AbstractA Cartesian graph bundle is a generalization of a graph covering and a Cartesian graph produ...
V tej nalogi bomo obravnavali pojma povezanost po povezavah in povezanost po vozliščih v produktih g...
AbstractLet G be a k-connected graph and Dc(G) denote the maximum diameter of G after deleting any o...
AbstractA Cartesian graph bundle is a generalization of a graph covering and a Cartesian graph produ...
Fault tolerance and transmission delay of networks are important concepts in network design. The not...
AbstractFault tolerance and transmission delay of networks are important concepts in network design....
Kartezični svežnji so posplošitev krovnih grafov in kartezičnih grafovskih produktov. Naj bo ▫$G$▫ n...
AbstractUse vi,κi,λi,δi to denote order, connectivity, edge-connectivity and minimum degree of a gra...
AbstractFault tolerance and transmission delay of networks are important concepts in network design....
AbstractThe product graph Gm*Gp of two given graphs Gm and Gp was defined by Bermond et al. [Large g...
Let ▫${mathcal{D}}^E_q(G)$▫ denote the diameter of a graph ▫$G$▫ after deleting any of its ▫$q$▫ edg...
V diplomski nalogi so v prvem poglavju zapisane osnovne definicije in lastnosti iz teorije grafov. V...
Cartesian graph bundles is a class of graphs that is a generalization of the Cartesian graph product...
AbstractLet G be a k-connected graph and Dc(G) denote the maximum diameter of G after deleting any o...
www.elsevier.com/locate/ipl The (k − 1)-fault diameter Dk(G) of a k-connected graph G is the maximum...
AbstractA Cartesian graph bundle is a generalization of a graph covering and a Cartesian graph produ...
V tej nalogi bomo obravnavali pojma povezanost po povezavah in povezanost po vozliščih v produktih g...
AbstractLet G be a k-connected graph and Dc(G) denote the maximum diameter of G after deleting any o...
AbstractA Cartesian graph bundle is a generalization of a graph covering and a Cartesian graph produ...
Fault tolerance and transmission delay of networks are important concepts in network design. The not...
AbstractFault tolerance and transmission delay of networks are important concepts in network design....
Kartezični svežnji so posplošitev krovnih grafov in kartezičnih grafovskih produktov. Naj bo ▫$G$▫ n...
AbstractUse vi,κi,λi,δi to denote order, connectivity, edge-connectivity and minimum degree of a gra...
AbstractFault tolerance and transmission delay of networks are important concepts in network design....
AbstractThe product graph Gm*Gp of two given graphs Gm and Gp was defined by Bermond et al. [Large g...
Let ▫${mathcal{D}}^E_q(G)$▫ denote the diameter of a graph ▫$G$▫ after deleting any of its ▫$q$▫ edg...