On the surface area of the augmented cubes

Cheng, Eddie; Qiu, Ke; Shen, Zhizhang
September 2012
Journal of Supercomputing;Sep2012, Vol. 61 Issue 3, p856
Academic Journal
The surface area of a communication network centered at a certain vertex, i.e., the number of vertices at the same distance from this given vertex within such a network, provides an important measurement of the broadcasting and other intercommunication capabilities of this network and can find several other applications in network studies. Following a generating function approach, we derive a closed-form expression of the surface area of the recently much discussed augmented cube network and its average distance.


Related Articles

  • Crossed Rings—Small-diameter Multiring Switches and Their 1-1-Rearrangeability. Podlazov, V. S. // Automation & Remote Control;Apr2004, Vol. 65 Issue 4, p642 

    Consideration was given to the direct switches structured as oriented multirings with a diameter half that of the existing multirings, conditions for their nonblockability at the channel switching on arbitrary permutations, and transformations of oriented crossed rings into nonoriented crossed...

  • Minimum Linear Arrangement of Incomplete Hypercubes. Miller, Mirka; Rajan, R. Sundara; Parthiban, N.; Rajasingh, Indra // Computer Journal;Feb2015, Vol. 58 Issue 2, p331 

    The minimum linear arrangement problem is a combinatorial optimization problem whose goal is to find a linear layout of a network in such way that a certain objective cost function is optimized. In this paper, we compute the minimum linear arrangement of incomplete hypercubes using graph embeddings.

  • On the Topological Properties of Grid-Based Interconnection Networks: Surface Area and Volume of Radial Spheres. Sarbazi-Azad, H.; Khonsari, A.; Ould-Khaoua, M. // Computer Journal;May2011, Vol. 54 Issue 5, p726 

    Grid-based networks (or grids for short), such as meshes and tori, have been the underlying topology for many multicomputers, and have been extensively studied in the past as a graph topology. In this paper, we investigate some topological properties of grids without boundary wrap-around...

  • The Stretched Network: Properties, Routing, and Performance. Shareghi, P.; Sarbazi-Azad, H. // Journal of Information Science & Engineering;Mar2008, Vol. 24 Issue 2, p361 

    In this paper, we study a class of interconnection networks for multiprocessors, called the Stretched-G network, which is based on a base graph G by replacing each edge of the base network with an array of processors. Two interesting features of the proposed topology are its area-efficient VLSI...

  • An Efficient Algorithm for Perfect Load Balancing on Hypercube Multiprocessors. Jan, Gene Eu; Hwang, Yuan-Shin // Journal of Supercomputing;May2003, Vol. 25 Issue 1, p5 

    This paper proposes a simple yet efficient algorithm to distribute loads evenly on multiprocessor computers with hypercube interconnection networks. This algorithm was developed based upon the well-known dimension exchange method. However, the error accumulation suffered by other algorithms...

  • One-to-Many Embeddings of Hypercubes into Cayley Graphs Generated by Reversals. Gardner, L.; Miller, Z.; Pritikin, D.; Sudborough, I. H. // Theory of Computing Systems;Sep/Oct2001, Vol. 34 Issue 5, p399 

    Among Cayley graphs on the symmetric group, some that have a noticeably low diameter relative to the degree of regularity are examples such as the �star� network and the �pancake� network, the latter a representative of a variety of Cayley graphs generated by reversals. These...

  • Application of a Method on Optimization of Thin-walled Column'S Crashworthiness Based on Metamodel. Yimin Mo; Jie Zhang; Bingheng Qin; Juncheng Lv // Applied Mechanics & Materials;2014, Issue 526, p109 

    In this paper the crashworthiness of a thin-walled column is selected as the optimization goal and its section gauge size parameters are defined as variables. We use Optimal latin hypercube design method and ASA optimization method respectively to define sampling design points and find optimal...

  • PERFORMANCE MODELLING OF TORUS INTERCONNECTION NETWORKS WITH DEEP BUFFERS. Alzeidi, N.; O.-Khaoua, M.; Khonsari, A. // International Journal of Computers & Applications (Acta Press);2010, Vol. 32 Issue 1, p1 

    Analytical models of deterministic routing in wormhole-switched networks have been widely reported in the literature. However, all of these models have assumed no, or neglectable, buffers at each switching element of the network. This paper proposes a new analytical model for wormhole-switched...

  • The Effect of Choosing Proper Overlay Topology on the Peer to Peer Networks' Properties. Gharib, Mohammed; Soudi, Amirreza // International Journal of Computer Science & Information Security;Apr2012, Vol. 10 Issue 4, p99 

    P2P networks have attracted attention of many Internet users due to their ability to share large volume of data (mostly video and music) among people regardless of their locations. The underlay of such networks is usually based on Internet infrastructure. Thus a large amount of the Internet...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics