Fault diameter of product graphs
Information Processing Letters
On the 3-restricted edge connectivity of permutation graphs
Discrete Applied Mathematics
Edge fault-diameter of graph product
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume II
Fault diameters of graph products and bundles
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume II
The k-restricted edge-connectivity of a product of graphs
Discrete Applied Mathematics
On average connectivity of the strong product of graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
The product graph Gm*Gp of two given graphs Gm and Gp, defined by J.C. Bermond et al. [J Combin Theory, Series B 36 (1984) 32–48] in the context of the so-called (Δ,D)-problem, is one interesting model in the design of large reliable networks. This work deals with product graphs for which we provide bounds for the connectivity parameter κ. Moreover, we state sufficient conditions that guarantee these product graphs to be maximally connected or superconnected. As a consequence, we deduce that even small networks with low reliability may lead to larger networks with high levels of fault-tolerance. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 48(3), 114–120 2006