PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Mixed connectivity of Cartesian graph products and bundles.
Rija Erveš and Janez Žerovnik
In: 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization [also] CWT2010, May 25-27 2010, cologne, Germany.

Abstract

An interconnection network should be fault tolerant, because practical communication networks are exposed to failures of network components. Both failures of nodes and failures of connections between them happen and it is desirable that a network is robust in the sense that a limited number of failures does not break down the whole system.In order to study the fault diameters of graph products and bundles under mixed faults, it is important to understand the generalized connectivities. We define mixed connectivity which generalizes both vertex and edge connectivity, and observe some basic facts for any connected graph. Furthermore, we generalize results of vertex connectivity and edge connectivity of Cartesian graph bundles.

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