Browse > Article

Matching Preclusion Problem in Restricted HL-graphs and Recursive Circulant $G(2^m,4)$  

Park, Jung-Heum (가톨릭대학교 컴퓨터정보공학부)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.35, no.2, 2008 , pp. 60-65 More about this Journal
Abstract
The matching preclusion set of a graph is a set of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. The matching preclusion number is the minimum cardinality over all matching preclusion sets. We show in this paper that, for any $m{\geq}4$, the matching preclusion numbers of both m-dimensional restricted HL-graph and recursive circulant $G(2^m,4)$ are equal to degree m of the networks, and that every minimum matching preclusion set is the set of edges incident to a single vertex.
Keywords
Perfect matching; almost perfect matching; edge fault; fault-tolerance; fault-hamiltonicity; interconnection networks;
Citations & Related Records
연도 인용수 순위
  • Reference
1 R.C. Brigham, F. Harary, E.C. Violin, J. Yellen, "Perfect-matching preclusion," Congressus Numerantium 174, pp. 185-192, 2005
2 J.-H. Park, H.-S. Lim, and H.-C. Kim, "Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements," Theoretical Computer Science 377, pp. 170-180, 2007   DOI
3 J.-H. Park and K.Y. Chwa, "Recursive circulants and their embeddings among hypercubes," Theoretical Computer Science 244, pp. 35-62, 2000   DOI   ScienceOn
4 C.-H. Tsai, J.M. Tan, Y.-C. Chuang, and L.-H. Hsu, "Fault-free cycles and links in faulty recursive circulant graphs," in Proc. of Workshop on Algorithms and Theory of Computation ICS2000, pp. 74-77, 2000
5 J.-H. Park, "Panconnectivity and edge-pancyclicity of faulty recursive circulant $G(2^m,4)$," Theoretical Computer Science, 390, pp. 70-80, 2008   DOI   ScienceOn
6 D.A. Reed and R.M. Fujimoto, Multicomputer Networks: Message-Based Parallel Processing, The MIT Press, 1987
7 D. Kratsch, T. Kloks, and H. Muller, "Measuring the vulnerability for classes of intersection graphs," Discrete Applied Mathematics 77, pp. 259-270, 1997   DOI   ScienceOn
8 J.-H. Park, H.-C. Kim, and H.-S. Lim, "Fault- hamiltonicity of hypercube-like interconnection networks," in Proc. of the IEEE International Parallel & Distributed Processing Symposium IPDPS 2005, Apr. 2005
9 A.-H. Esfahanian, "Generalized measures of fault tolerance with application to n-cube networks," IEEE Trans. Computers 38(11), pp. 1586-1591, 1989   DOI   ScienceOn
10 E. Cheng and L. Liptak, "Matching preclusion for some interconnection networks," Networks 50, pp. 173-180, 2007   DOI   ScienceOn