AbstractA Cartesian graph bundle is a generalization of a graph covering and a Cartesian graph product. Let G be a kG-edge connected graph and D̄c(G) be the largest diameter of subgraphs of G obtained by deleting c<kG edges. We prove that D̄a+b+1(G)≤D̄a(F)+D̄b(B)+1 if G is a graph bundle with fibre F over base B, a<kF, and b<kB. As an auxiliary result we prove that the edge-connectivity of graph bundle G is at least kF+kB
AbstractThis work deals with a generalization of the Cartesian product of graphs, the product graph ...
V diplomski nalogi so v prvem poglavju zapisane osnovne definicije in lastnosti iz teorije grafov. V...
AbstractLet DqE(G) denote the maximum diameter among all subgraphs obtained by deleting q edges of G...
AbstractA Cartesian graph bundle is a generalization of a graph covering and a Cartesian graph produ...
Cartesian graph bundles is a class of graphs that is a generalization of the Cartesian graph product...
AbstractFault tolerance and transmission delay of networks are important concepts in network design....
www.elsevier.com/locate/ipl The (k − 1)-fault diameter Dk(G) of a k-connected graph G is the maximum...
Fault tolerance and transmission delay of networks are important concepts in network design. The not...
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....
V disertaciji raziskujemo povezanost in okvarne premere kartezičnih grafovskih svežnjev in kartezičn...
Kartezični svežnji so posplošitev krovnih grafov in kartezičnih grafovskih produktov. Naj bo ▫$G$▫ n...
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...
AbstractLet f(t,k) be the maximum diameter of graphs obtained by deleting t edges from a (t+1)-edge-...
AbstractThis work deals with a generalization of the Cartesian product of graphs, the product graph ...
V diplomski nalogi so v prvem poglavju zapisane osnovne definicije in lastnosti iz teorije grafov. V...
AbstractLet DqE(G) denote the maximum diameter among all subgraphs obtained by deleting q edges of G...
AbstractA Cartesian graph bundle is a generalization of a graph covering and a Cartesian graph produ...
Cartesian graph bundles is a class of graphs that is a generalization of the Cartesian graph product...
AbstractFault tolerance and transmission delay of networks are important concepts in network design....
www.elsevier.com/locate/ipl The (k − 1)-fault diameter Dk(G) of a k-connected graph G is the maximum...
Fault tolerance and transmission delay of networks are important concepts in network design. The not...
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....
V disertaciji raziskujemo povezanost in okvarne premere kartezičnih grafovskih svežnjev in kartezičn...
Kartezični svežnji so posplošitev krovnih grafov in kartezičnih grafovskih produktov. Naj bo ▫$G$▫ n...
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...
AbstractLet f(t,k) be the maximum diameter of graphs obtained by deleting t edges from a (t+1)-edge-...
AbstractThis work deals with a generalization of the Cartesian product of graphs, the product graph ...
V diplomski nalogi so v prvem poglavju zapisane osnovne definicije in lastnosti iz teorije grafov. V...
AbstractLet DqE(G) denote the maximum diameter among all subgraphs obtained by deleting q edges of G...
DOI
Add to ORKG