The edge-centered surface area of the arrangement graph

Authors:
Eddie Cheng;Ke Qiu;Zhizhang Shen
Affiliations:
Department of Mathematics and Statistics, Oakland University, Rochester, USA;Department of Computer Science, Brock University, St. Catharines, Canada;Department of Computer Science and Technology, Plymouth State University, Plymouth, USA
Venue:
Journal of Combinatorial Optimization
Year:
2014

Citing 9
Cited 0

A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
Whitney numbers of the second kind for the star poset

European Journal of Combinatorics
Arrangement graphs: a class of generalized star graphs

Information Processing Letters
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Concrete Math

Concrete Math
On Some Properties of k-Ary n-Cubes

ICPADS '01 Proceedings of the Eighth International Conference on Parallel and Distributed Systems
On the surface area of the (n,k)-star graph

Theoretical Computer Science
On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs

International Journal of Computer Mathematics
A general technique to establish the asymptotic conditional diagnosability of interconnection networks

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We suggest the notion of the edge-centered surface area for an interconnection network, which generalizes the usual notion of surface area of a network centered at a vertex. Following an elementary approach, we derive an explicit formula expression of the edge-centered surface area for the general arrangement graph.