Connectivity of Cayley Digraphs
Connectivity of Cayley Digraphs
复制标题
DOI：
10.1007/978-1-4757-2491-2_2
复制
发表时间：
1996
期刊：
影响因子：
--
通讯作者：
R. Tindell
中科院分区：
文献类型：
--
作者：
R. Tindell
The purpose of this chapter is to study several important mathematical problems related to the interconnection structure of networks. Thus the objects of our study are directed and undirected graphs. In many situations it is highly advantageous to use interconnection networks which are highly symmetric. This often simplifies computational and routing algorithms. One way in which symmetric networks may be constructed is to use interconnection schemes based on the algebraic structure called a group. Such digraphs are called Cayley digraphs and are the primary objects of study in this chapter. We shall concentrate on network connectivity, which may be viewed as measures of vulnerability of the network to global failure as the result either of failures of nodes or failures of links. Many of the results to be presented are valid for more general classes of digraphs than Cayley digraphs; where this is the case we have attempted to carry out the development at the most general level consistent with our overall goals.
