Issue No. 06 - June (1994 vol. 43)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.286309
<p>The star graph has recently been suggested as an alternative to the hypercube. The star graph has a rich structure and symmetry properties as well as desirable fault-tolerant characteristics. The star graph's maximum vertex degree and diameter, viewed as functions of network size, grow less rapidly than the corresponding measures in a hypercube. We investigate the genus of the star graph and compare it with the genus of the hypercube.</p>
hypercube networks; fault tolerant computing; reliability; genus of star graphs; hypercube; symmetry properties; fault-tolerant characteristics; maximum vertex degree.
D.A. Hoelzeman, S. Bettayeb, "On the Genus of Star Graphs", IEEE Transactions on Computers, vol. 43, no. , pp. 755-759, June 1994, doi:10.1109/12.286309