doi: 10.7763/IJIMT.2012.V3.219
Local-Connectivity and Maximal Local-Connectivity on the class of Matching Composition Networks
Tsung-Han Tsai1
,
Lun-Min Shih2 ,
Chieh-Feng Chiang1 ,
Lih-Hsing Hsu3 ,
Jimmy J. M. Tan1
- 1Department of Computer Science, National Chiao Tung University, Hsinchu 30010, Taiwan, R.O.C
- 2Department of Accounting Information, Da-Yah University, Changhua 51591, Taiwan, R. O. C.
- 3Department of Computer Science and Information Engineering, Providence University, Taichung 43301, Taiwan, R.O.C.
Abstract
The local connectivity of two vertices is defined as the maximum number of internally vertex-disjoint paths between them. In this paper, we define two vertices to be maximally local-connected, if the maximum number of internally vertex-disjoint paths between them equals the minimum degree of these two vertices. We prove that a (k + 1)-regular Matching Composition Network is maximally local-connected, even if there are at most (k − 1) faulty vertices in it.
Keywords
- Interconnection networks
- connectivity
- local connectivity
- matching composition network
How to Cite
Tsung-Han Tsai, Lun-Min Shih, Chieh-Feng Chiang, Lih-Hsing Hsu, and Jimmy J. M. Tan, "Local-Connectivity and Maximal Local-Connectivity on the class of Matching Composition Networks," International Journal of Innovation, Management and Technology, vol. 3, no. 3, pp. 194-197, 2012. https://doi.org/10.7763/IJIMT.2012.V3.219
Copyright & License
Copyright © 2012 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).