On the Surface Area of the (n, k)-Star Graph

Authors:
Zhizhang Shen;Ke Qiu;Eddie Cheng
Affiliations:
Dept. of Computer Science and Technology, Plymouth State University, USA;Dept. of Computer Science, Brock University, Canada;Dept. of Mathematics and Statistics, Oakland University, USA
Venue:
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Year:
2008

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
The (n,k)-star graph: a generalized star graph

Information Processing Letters
Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks

IEEE Transactions on Parallel and Distributed Systems
On Some Combinatorial Properties of the Star Graph

ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
Constructing vertex-disjoint paths in (n, k)-star graphs

Information Sciences: an International Journal
On the Whitney numbers of the second kind for the star poset

European Journal of Combinatorics
Vertex-symmetric generalized Moore graphs

Discrete Applied Mathematics
Some properties of WK-recursive and swapped networks

ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an explicit formula of the surface area of the (n, k)-star graphs , i.e., |{v|d(e, v) = d}|, where eis the identity node of such a graph; by identifying the cyclic structures of all the nodes in the graph, presenting a minimum routing algorithm between any node in the graph and e, and enumerating those nodes v, such that d(e, v) = d.