Cartesian graph bundles is a class of graphs that is a generalization of the Cartesian graph products. Let ▫$G$▫ be a ▫$k_G$▫-connected graph and ▫${mathcal{D}}_c(G)$▫ denote the diameter of ▫$G$▫ after deleting any of its ▫$c < k_G$▫ vertices. We prove that if ▫$G_1, G_2, dots, G_q$▫ are ▫$k_1$▫-connected, ▫$k_2$▫-connected,...,▫$k_q$▫-connected graphs and ▫$0 leq a_1 < k_1$▫, ▫$0 leq a_2 < k_2$▫,...,▫$0 leq a_q < k_q$▫ and ▫$a = a_1 + a_2 + dots + a_q + (q-1)$▫, then the fault diameter of ▫$G$▫, a Cartesian product of ▫$G_1$▫, ▫$G_2$▫,...,▫$G_q$▫, with ▫$a$▫ faulty nodes is ▫${mathcal{D}}_{a}(G) leq {mathcal{D}}_{a_1}(G_1)+{mathcal{D}}_{a_2}(G_2) + dots + {mathcal{D}}_{a_q}(G_q) + 1$▫. We also show that ▫${mathcal{D}}_{a+b+1}(G) leq {math...
We derive the fault-diameter of the star graph using a combinatorial method, thereby resting the pre...
Graph theory and its wide applications in natural sciences and social sciences open a new era of res...
AbstractThe bounded edge-connectivity λk(G) of a connected graph G with respect to k(≥d(G)) is the m...
AbstractLet G be a k-connected graph and Dc(G) denote the maximum diameter of G after deleting any o...
Fault tolerance and transmission delay of networks are important concepts in network design. The not...
AbstractA Cartesian graph bundle is a generalization of a graph covering and a Cartesian graph produ...
www.elsevier.com/locate/ipl The (k − 1)-fault diameter Dk(G) of a k-connected graph G is the maximum...
AbstractLet G be a k-connected graph and Dc(G) denote the maximum diameter of G after deleting any o...
AbstractFault tolerance and transmission delay of networks are important concepts in network design....
AbstractA Cartesian graph bundle is a generalization of a graph covering and a Cartesian graph produ...
AbstractFault tolerance and transmission delay of networks are important concepts in network design....
V disertaciji raziskujemo povezanost in okvarne premere kartezičnih grafovskih svežnjev in kartezičn...
AbstractWe introduce the concept of fault diameter of interconnection networks. The motivation is to...
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...
We derive the fault-diameter of the star graph using a combinatorial method, thereby resting the pre...
Graph theory and its wide applications in natural sciences and social sciences open a new era of res...
AbstractThe bounded edge-connectivity λk(G) of a connected graph G with respect to k(≥d(G)) is the m...
AbstractLet G be a k-connected graph and Dc(G) denote the maximum diameter of G after deleting any o...
Fault tolerance and transmission delay of networks are important concepts in network design. The not...
AbstractA Cartesian graph bundle is a generalization of a graph covering and a Cartesian graph produ...
www.elsevier.com/locate/ipl The (k − 1)-fault diameter Dk(G) of a k-connected graph G is the maximum...
AbstractLet G be a k-connected graph and Dc(G) denote the maximum diameter of G after deleting any o...
AbstractFault tolerance and transmission delay of networks are important concepts in network design....
AbstractA Cartesian graph bundle is a generalization of a graph covering and a Cartesian graph produ...
AbstractFault tolerance and transmission delay of networks are important concepts in network design....
V disertaciji raziskujemo povezanost in okvarne premere kartezičnih grafovskih svežnjev in kartezičn...
AbstractWe introduce the concept of fault diameter of interconnection networks. The motivation is to...
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...
We derive the fault-diameter of the star graph using a combinatorial method, thereby resting the pre...
Graph theory and its wide applications in natural sciences and social sciences open a new era of res...
AbstractThe bounded edge-connectivity λk(G) of a connected graph G with respect to k(≥d(G)) is the m...