By Topic

Comments on "Low Diameter Interconnections for Routing in High-Performance Parallel Systems," with Connections and Extensions to Arc Coloring of Coset Graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Wenjun Xiao ; Dept. of Comput. Sci., South China Univ. of Technol., Guangzhou ; Wenhong Wei ; Weidong Chen ; Mingxin He
more authors

"For original paper see R. Melhem, ibid., vol.56, p.502-10, (2007)". Recently, Melhem presented a "new" class of low-diameter interconnection (LDI) networks, (IEEE Trans. computers, Vol. 56, No. 4, pp. 502-510). We note that LDI networks are the same as the previously known generalized de Bruijn graphs, point out an error in the decomposition of LDI networks into permutations, and find that the correct decomposition scheme is an instance of arc coloring for coset graphs. Hence, we pursue a number of general results on arc coloring of coset graphs that can be applied to this particular decomposition problem as well as within many other contexts, including complete arc coloring and normality of coset graphs.

Published in:

Computers, IEEE Transactions on  (Volume:57 ,  Issue: 12 )