World Scientific
  • Search
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website www.worldscientific.com.

System Upgrade on Tue, Oct 25th, 2022 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

A short note on the surface area of star graphs

    In this short note, we use a generating function to give an explicit formula for the surface area of the star graphs.

    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
    • F. Portier and T. Vaughan, Europ. J. Combinatorics 11, 277 (1990). Crossref, ISIGoogle 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
    • K. Qiu and S. Akl, VLSI Design 2, 389 (1995), DOI: 10.1155/1995/61390. Crossref, ISIGoogle Scholar
    • I. P.   Goulden and D. M.   Jackson , Combinatorial Enumeration ( Wiley , 1983 ) . Google Scholar
    • H. S.   Wilf , Generatingfunctionology ( Academic Press , 1990 ) . Google Scholar