Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Bauer, F. Boesch, C. Suffel and R. Tindell, Connectivity extremal problems and the design of reliable probablistic networks, The Theory and Applications of Graphs (Chartrand et. al., Editors), Wiley, New York (1985) 45–54.
F. Boesch and J. Wang, Super line connectivity properties of circulant graphs, SIAM J. Alg. Discr. Methods 7 (1986) 89–98.
G. Chaty, On critically and minimally k vertex (arc) connected digraphs, Proc. Keszthely (1976) 193–203.
C. D. Godsil, Connectivity of minimal Cayley graphs, Arch. Math. 37 (1981) 437–476.
Y. O. Hamidoune, Sur les atomes d’un graphe orienté, C.R. Acad. Sc. Paris Ser. A 284 (1977) 1253–1256.
Y. O. Hamidoune, Quelques problèmes de connexité dans les graphes orienté, J. Comb. Theory Ser. B 30 (1981) 1–10.
Y. O. Hamidoune, On the Connectivity of Cayley Digraphs, Europ. J. Comb. 5 (1984) 309–312.
Y. O. Hamidoune, Sur la separation dans les graphes de Cayley Abelien, Disrcete Math. 55 (1985) 323–326.
Y. O. Hamidoune, Connectivité des graphes de Cayley Abeliens sans K4, Discrete Math. 83 (1990) 21–26.
Y. O. Hamidoune and R. Tindell, Vertex transitivity and super line connectedness, SIAM J. Discr. Math. 3 (1990) 524–530.
W. Imrich, On the connectivity of Cayley Graphs, J. Comb. Theory Series B 26 (1979) 323–326.
W. Mader, Minimale n-fach kantenzusammenhängenden Graphen, Math. Ann. 191 (1971) 21–28.
W. Mader, Ein Eigenschaft der Atome endlicher Graphen, Arch. Math.22 (1971) 331–336.
W. Mader, Uber den zusammen symmetricher Graphen, Arch. Math. 21 (1970) 331–336.
R. Tindell, Edge connectivity properties of symmetric graphs, preprint, Stevens Institute of Technology 1982.
M. E. Watkins, Connectivity of transitive graphs, J. Comb. Theory 8 (1970) 23–29.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Tindell, R. (1996). Connectivity of Cayley Digraphs. In: Du, DZ., Hsu, D.F. (eds) Combinatorial Network Theory. Applied Optimization, vol 1. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2491-2_2
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2491-2_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4752-9
Online ISBN: 978-1-4757-2491-2
eBook Packages: Springer Book Archive