Reliability of interconnection networks modeled by a product of graphs

被引：15

作者：

Balbuena, C.

Garcia-Vazquez, P. ^{[1
]}

Marcote, X.

机构：

[1] Univ Sevilla, Dept Matemat Aplicada 1, Seville, Spain

[2] Univ Politecn Catalunya, Dept Matemat Aplicada 3, Barcelona, Spain

来源：

NETWORKS | 2006年 / 48卷 / 03期

关键词：

connectivity; maximally connected graphs; superconnected graphs; permutation graphs; cartesian product;

D O I：

10.1002/net.20124

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

The product graph G(m) * G(p) of two given graphs G(m) and G(p), defined by J.C. Bermond et al. [J Combin Theory, Series B 36 (1984) 32-48] in the context of the so-called (Delta, 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 kappa. 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. (C) 2006 Wiley Periodicals, Inc.

引用

页码：114 / 120

页数：7

共 18 条

[11] Distance and connectivity measures in permutation graphs [J].