PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Edge fault-diameter of graph product.
Janez Žerovnik
In: WSEAS, July 23-25 2010, Corfu Island, Greece.


The product graph B ¤ F of graphs B and F is an interesting model in the design of large reliable networks. Let G be a kG-edge connected graph and DE c (G) be the largest diameter of subgraphs of G obtained by deleting c < kG edges. We prove that DE a+b+1(B ? F) · DE a (F) + DE b (B) + 1 where a < kF , and b < kB.

EPrint Type:Conference or Workshop Item (Talk)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:7092
Deposited By:Igor Pesek
Deposited On:01 March 2011