On some combinatorial properties of the star graph

14Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The star graph, as an interesting network topology, has been extensively studied in the past. In this paper, we address some of the combinatorial properties of the star graph. In particular, we consider the problem of calculating the surface area of the star graph, answering an open problem previously posed in [12]. © 2005 IEEE.

Cite

CITATION STYLE

APA

Imani, N., Sarbazi-Azad, H., & Akl, S. G. (2005). On some combinatorial properties of the star graph. In Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN (Vol. 2005, pp. 6–11). IEEE Computer Society. https://doi.org/10.1109/ISPAN.2005.63

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free