On Some Combinatorial Properties of the Star Graph

Authors:
N. Imani;H. Sarbazi-Azad;S. G. Akl
Affiliations:
IPM School of Computer Science, Tehran, Iran;Sharif University of Technology, Tehran, Iran;Queen's University, Canada
Venue:
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
Year:
2005

Citing 0
Cited 9

A comparative study of job allocation and migration in the pancake network

Information Sciences: an International Journal
Robustness of star graph network under link failure

Information Sciences: an International Journal
Substar Reliability Analysis in Star Networks

Information Sciences: an International Journal
Some topological and combinatorial properties of WK-recursive mesh and WK-pyramid interconnection networks

Journal of Systems Architecture: the EUROMICRO Journal
On the Surface Area of the (n, k)-Star Graph

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Improving bounds on link failure tolerance of the star graph

Information Sciences: an International Journal
Properties of a hierarchical network based on the star graph

Information Sciences: an International Journal
A combinatorial study of substar reliability of the star network

International Journal of High Performance Systems Architecture
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

The star graph, as an interesting network topology, has been extensively studied in the past. In this paper, we address some of the combinatorial properties of the star graph. In particular, we consider the problem of calculating the surface area of the star graph, answering an open problem previously posed in [12].