loading...
On Some Combinatorial Properties of the Star Graph
Las Vegas, Nevada, USA December 07-December 09
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPAN.2005.638th International Symposium on Parall ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
N. Imani, IPM School of Computer Science, Tehran, Iran
H. Sarbazi-Azad, Sharif University of Technology, Tehran, Iran
S.G. Akl, Queen?s University, Canada
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].
Citation:
N. Imani, H. Sarbazi-Azad, S.G. Akl, "On Some Combinatorial Properties of the Star Graph," ispan, pp.58-65, 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.