A recurrence for the surface area of (n, k)-arrangement graphs

Abstract

An interesting property of an interconnected network is the number of nodes at distance i from an arbitrary processor, namely the node-centred surface area. This is an important property due to its applications in various fields of study. The ( n , k ) -arrangement graphs, denoted as A ( n , k ) are important class of graphs as they address the scalability issue in simpler topologies such as the hypercube and the star graph. Much work has been done to obtain a closed-form formula for the surface area of this class of graphs, but generally, it is not trivial to find an algorithm to compute the surface area of such graphs in polynomial time or to find an explicit formula with polynomially many terms in regard to the graph's parameters. In this paper, we present a simple recurrence that has linear computational complexity for A ( n , k ) for any arbitrary n and k in their defined range.