AbstractLet G be a k-connected graph and Dc(G) denote the maximum diameter of G after deleting any of its c<k vertices. We prove that if G1,G2,…,Gq are k1-connected, k2-connected, …, kq-connected graphs and 0⩽a1<k1, 0⩽a2<k2, …, 0⩽aq<kq and a=a1+a2+⋯+aq+(q−1), then the fault diameter of G, the Cartesian product of G1,G2,…,Gq, with a faulty nodes satisfies the inequality Da(G)⩽Da1(G1)+Da2(G2)+⋯+Daq(Gq)+1
Let ▫${mathcal{D}}^E_q(G)$▫ denote the maximum diameter among all subgraphs obtained by deleting ▫$q...
AbstractLet f(t, D) denote the maximum possible diameter of a graph obtained from a (t+1)-edge-conne...
AbstractWe study connection networks in which certain pairs of nodes have to be connected by k edge-...
AbstractLet G be a k-connected graph and Dc(G) denote the maximum diameter of G after deleting any o...
Cartesian graph bundles is a class of graphs that is a generalization of the Cartesian graph product...
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...
Fault tolerance and transmission delay of networks are important concepts in network design. The not...
AbstractWe introduce the concept of fault diameter of interconnection networks. The motivation is to...
AbstractFault tolerance and transmission delay of networks are important concepts in network design....
AbstractLet DqE(G) denote the maximum diameter among all subgraphs obtained by deleting q edges of G...
V disertaciji raziskujemo povezanost in okvarne premere kartezičnih grafovskih svežnjev in kartezičn...
AbstractA Cartesian graph bundle is a generalization of a graph covering and a Cartesian graph produ...
We derive the fault-diameter of the star graph using a combinatorial method, thereby resting the pre...
AbstractConcern over fault tolerance in the design of interconnection networks has stimulated intere...
Let ▫${mathcal{D}}^E_q(G)$▫ denote the maximum diameter among all subgraphs obtained by deleting ▫$q...
AbstractLet f(t, D) denote the maximum possible diameter of a graph obtained from a (t+1)-edge-conne...
AbstractWe study connection networks in which certain pairs of nodes have to be connected by k edge-...
AbstractLet G be a k-connected graph and Dc(G) denote the maximum diameter of G after deleting any o...
Cartesian graph bundles is a class of graphs that is a generalization of the Cartesian graph product...
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...
Fault tolerance and transmission delay of networks are important concepts in network design. The not...
AbstractWe introduce the concept of fault diameter of interconnection networks. The motivation is to...
AbstractFault tolerance and transmission delay of networks are important concepts in network design....
AbstractLet DqE(G) denote the maximum diameter among all subgraphs obtained by deleting q edges of G...
V disertaciji raziskujemo povezanost in okvarne premere kartezičnih grafovskih svežnjev in kartezičn...
AbstractA Cartesian graph bundle is a generalization of a graph covering and a Cartesian graph produ...
We derive the fault-diameter of the star graph using a combinatorial method, thereby resting the pre...
AbstractConcern over fault tolerance in the design of interconnection networks has stimulated intere...
Let ▫${mathcal{D}}^E_q(G)$▫ denote the maximum diameter among all subgraphs obtained by deleting ▫$q...
AbstractLet f(t, D) denote the maximum possible diameter of a graph obtained from a (t+1)-edge-conne...
AbstractWe study connection networks in which certain pairs of nodes have to be connected by k edge-...
DOI
Add to ORKG