scientific article; zbMATH DE number 2040828

MaRDI QIDQ4451922zbMATH OpenFDO

Authors Satoru Watanabe, Satoshi Okawa

Publication date 11 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2745/27450220.htm

zbMATH Keywords

Cayley graphsdiameterhypercubesstar graphsrouting algorithmdegree four Cayley graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10)

Recommendations

• The (n,k)-star graph: A generalized star graph
• Topological properties of star graphs
• The hyperstar interconnection network
• Arrangement graphs: A class of generalized star graphs
• scientific article; zbMATH DE number 2170426

Cited in

(10)

• Node-ranking schemes for the star networks.
• Study of general incomplete star interconnection networks
• On VLSI layouts of the star graph and related networks
• Extensions of networks with given diameter
• The (n,k)-star graph: A generalized star graph
• scientific article; zbMATH DE number 1983293 (Why is no real title available?)
• EFFICIENT ALGORITHMS ON THE HYPERSTAR NETWORK
• The permutational graph: A new network topology
• Properties of a hierarchical network based on the star graph
• Optimal parallel routing in star graphs (extended abstract)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4451922)