Some conclusions on cayley digraphs and their applications to interconnection networks

3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this short communication, we survey the relationships between Cayley digraphs and their subgraphs and coset graphs with respect to subgroups and obtain some general results on homomorphism and broadcasting between them. We also obtain a factorization of Cayley digraphs on subgraphs. We discuss the applications of these results to well-known interconnection networks. These conclusions possess potential application to grid computing. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Xiao, W., & Parhami, B. (2004). Some conclusions on cayley digraphs and their applications to interconnection networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3033, 408–412. https://doi.org/10.1007/978-3-540-24680-0_67

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free