Wide diameter of Cartesian graph bundles

Fault tolerance and transmission delay of networks are important concepts in network design. The notions are strongly related to connectivity and diameter of a graph, and have been studied by many authors. Wide diameter of a graph combines studying connectivity with the diameter of a graph. Diameter with width kk of a graph GG, kk-diameter, is defined as the minimum integer dd for which there exist at least kk internally disjoint paths of length at most dd between any two distinct vertices in GG. Denote by Dc(G)Dc(G) the cc-diameter of GG and κ(G)κ(G) the connectivity of GG. In the context of computer networks, wide diameters of Cartesian graph products have been recently studied by many authors. Cartesian graph bundles is a class of graphs that is a generalization of the Cartesian graph products. Let GG be a Cartesian graph bundle with fiber FF over base BB, 0