PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Edge fault-diameter of Cartesian graph bundles
Janez Žerovnik, Iztok Banič and Rija Erveš
In: Seventh Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 13-15 May 2008, Italy.

Abstract

We generalize the result of for two factors to Cartesian graph bundles. As a k-edge connected graph remains connected if up to k−1 edges are missing, we study the diameter of a graph with any permitted number of edges deleted. We show that the edge-connectivity of Cartesian graph bundle G with fibre F over the base graph B, is at least kF + kB, and we give an upper bound for the edge fault-diameter of Cartesian graph bundles in terms of edge fault-diameters of the fibre and the base graph. We also show that the bounds are tight.

EPrint Type:Conference or Workshop Item (Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:4618
Deposited By:Igor Pesek
Deposited On:13 March 2009