| Wide Diameter of Generalized Petersen Graphs |
| Received:June 28, 2008 Revised:July 03, 2008 |
| Key Words:
Petersen graph diameter wide diameter.
|
| Fund Project:Supported by the National Natural Science Foundation of China (Grant No.60973014), the Excellent Young Teachers Program of Shanghai Municipal Education Conmision (Grant No.B-8101-07-0027) and Specialized Research Fund for the Doctoral Program of Higher Education of China (Grant No.200801411073). |
| Author Name | Affiliation | | Jun ZHANG | School of Mathematical Sciences, Dalian University of Technology, Liaoning 116024, P. R. China
College of Information Technology, Shanghai Ocean University, Shanghai 201306, P. R. China | | Xi Rong XU | Department of Computer Science, Dalian University of Technology, Liaoning 116024, P. R. China | | Jun WANG | School of Mathematical Sciences, Dalian University of Technology, Liaoning 116024, P. R. China |
|
| Hits: 2917 |
| Download times: 2994 |
| Abstract: |
| Generalized Petersen graphs are commonly used interconnection networks, and wide diameter is an important parameter to measure fault-tolerance and efficiency of parallel processing computer networks. In this paper, we show that the diameter and $3$-wide diameter of generalized Petersen graph $P(m,a)$ are both $O(\frac{m}{2a})$, where $a\geq 3$. |
| Citation: |
| DOI:10.3770/j.issn:1000-341X.2010.03.022 |
| View Full Text View/Add Comment |
|
|
|
