Some mathematical properties of cayley digraphs with applications to interconnection network design.
W. Xiao, и B. Parhami. International Journal of Computer Mathematics, 82 (5):
521 - 528(2005)
Аннотация
We consider the relationships between Cayley digraphs and their coset graphs with respect to subgroups and obtain some general results on homomorphism and broadcasting between them. We also derive a general factorization theorem on subgraphs of Cayley digraphs by their automorphism groups. We discuss the applications of these results to well-known interconnection networks such as the butterfly network, the de Bruijn network, the cube-connected cycles network and the shuffle-exchange network. ABSTRACT FROM AUTHOR
%0 Journal Article
%1 1700022220050501
%A Xiao, Wenjun
%A Parhami, Behrooz
%D 2005
%J International Journal of Computer Mathematics
%K Cayley_Graph Faktorisierung
%N 5
%P 521 - 528
%T Some mathematical properties of cayley digraphs with applications to interconnection network design.
%U http://search.ebscohost.com/login.aspx?direct=true&db=a9h&AN=17000222&site=ehost-live
%V 82
%X We consider the relationships between Cayley digraphs and their coset graphs with respect to subgroups and obtain some general results on homomorphism and broadcasting between them. We also derive a general factorization theorem on subgraphs of Cayley digraphs by their automorphism groups. We discuss the applications of these results to well-known interconnection networks such as the butterfly network, the de Bruijn network, the cube-connected cycles network and the shuffle-exchange network. ABSTRACT FROM AUTHOR
@article{1700022220050501,
abstract = {We consider the relationships between Cayley digraphs and their coset graphs with respect to subgroups and obtain some general results on homomorphism and broadcasting between them. We also derive a general factorization theorem on subgraphs of Cayley digraphs by their automorphism groups. We discuss the applications of these results to well-known interconnection networks such as the butterfly network, the de Bruijn network, the cube-connected cycles network and the shuffle-exchange network. [ABSTRACT FROM AUTHOR]},
added-at = {2011-05-03T11:08:12.000+0200},
author = {Xiao, Wenjun and Parhami, Behrooz},
biburl = {https://www.bibsonomy.org/bibtex/266480fb9f4bbde8b84ed8fe50993bd27/jabreftest},
groups = {public},
interhash = {806b0b553d384995567f638c6158152f},
intrahash = {66480fb9f4bbde8b84ed8fe50993bd27},
issn = {00207160},
journal = {International Journal of Computer Mathematics},
keywords = {Cayley_Graph Faktorisierung},
number = 5,
pages = {521 - 528},
timestamp = {2011-05-03T11:08:12.000+0200},
title = {Some mathematical properties of cayley digraphs with applications to interconnection network design.},
url = {http://search.ebscohost.com/login.aspx?direct=true&db=a9h&AN=17000222&site=ehost-live},
username = {jabreftest},
volume = 82,
year = 2005
}