On the Genus of Star Graphs

Document Type

Article

Publication Date

1-1-1994

Department

Computer & Information Science

Abstract

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. © 1994 IEEE

DOI

10.1109/12.286309

First Page

755

Last Page

759

Publication Title

IEEE Transactions on Computers

Comments

At the time of publication, David A. Hoelzeman was affiliated with Southeastern Oklahoma State University.

This document is currently not available here.

Share

COinS