No Access
A short note on the surface area of star graphs
https://doi.org/10.1142/S0129626409000031Cited by:11
Abstract
In this short note, we use a generating function to give an explicit formula for the surface area of the star graphs.
Keywords:
References
S. B. Akers , D. Harel and B. Krishnamurthy , The star graph: An attractive alternative to the n-cube, Proc. Int'l Conf. Parallel Processing (1987) pp. 393–400. Google Scholar- N. Imani, H. Sarbazi-Azad, and S.G. Akl, Some combinatorial properties of the star graphs, Discrete Mathematics (to appear). (Updated version of the paper in Proceedings of the IEEE International Symposium on Parallel Architectures, Algorithms, and Networks, Las Vegas, NV, Dec. 2005, 58 - 65.) . Google Scholar
- Europ. J. Combinatorics 11, 277 (1990). Crossref, ISI, Google Scholar
G. Fertin and A. Raspaud , k-Neighbourhood broadcasting, 8th International Colloquium on Structural Information and Communication Complexity (SIROCCO'01) (2001) pp. 133–146. Google Scholar- VLSI Design 2, 389 (1995), DOI: 10.1155/1995/61390. Crossref, ISI, Google Scholar
-
I. P. Goulden and D. M. Jackson , Combinatorial Enumeration ( Wiley , 1983 ) . Google Scholar -
H. S. Wilf , Generatingfunctionology ( Academic Press , 1990 ) . Google Scholar


