Edge Fault Tolerance Of Interconnection Networks With Respect To Maximally Edge-connectivity

An interconnection network is often modeled by a connected graph G,and the connectivity of G is an important parameter for fault tolerance of the network.A connected graph G=(V,E)is maximally edge-connected(or maximally-λfor short)if its edge-connectivity attains its minimum degree.We define a maximally-λgraph G to be m-maximally-λif G-S is still maximally-λfor any edge subset S?E(G)with|S|≤m.The maximum integer of such m,denoted by m_λ(G),is said to be the edge fault tolerance of G with respect to the maximally-λproperty.In this thesis,we discuss the edge fault tolerance for maximally-λproperty of three families of interconnection networks,and determine the exact values of m_λ(G)for some well-known networks.