Conditional matching preclusion sets

Information Sciences

Volumn 179, Issue 8, 2009, Pages 1092-1101

  Cheng, Eddie ^a   Lesniak, Linda ^b   Lipman, Marc J ^c   Lipták, László ^a  

^a OAKLAND UNIVERSITY   (United States)

^b DREW UNIVERSITY   (United States)

^c INDIANA UNIVERSITY PURDUE UNIVERSITY FORT WAYNE   (United States)

Author keywords

Almost perfect matching; Hypercubes; Interconnection networks; Perfect matching

Indexed keywords

INTERCONNECTION NETWORKS; TELECOMMUNICATION NETWORKS;

ALMOST-PERFECT MATCHING; HYPERCUBES; ISOLATED VERTICES; OPTIMAL SETS; PERFECT MATCHING; PERFECT MATCHINGS; SINGLE VERTICES;

GRAPH THEORY;

EID: 59149099104     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2008.10.029     Document Type: Article

References (15)

1. Arizumi N., Hamburger P., and Kostochka A. On k-detour subgraphs of hypercubes. Journal of Graph Theory 57 (2008) 55-64
2. Berge C. Sur le couplage maximun d'un graphe. Mathématique 247 (1958) 258-259
3. Brigham R.C., Harary F., Violin E.C., and Yellen J. Perfect-matching preclusion. Congressus Numerantium 174 (2005) 185-192
4. E. Cheng, Linda Lesniak, Marc J. Lipman, L. Lipták, Matching preclusion for alternating group graphs and their generalizations, International Journal of Foundations of Computer Science, in press.
5. Cheng E., and Lipták L. Matching preclusion for some interconnection networks. Networks 50 (2007) 173-180
6. Hall P. On representatives of subsets. Journal of London Mathematical Society 10 (1935) 26-30
7. Hsieh S.-Y. Some edge-fault-tolerant properties of the folded hypercube. Networks 51 (2008) 92-101
8. Lai C.-N., and Chen G.-H. w-Rabin numbers and strong w-Rabin numbers of folded hypercubes. Networks 51 (2008) 171-177
9. Ma M., Liu G., and Pan X. Path embedding in faulty hypercubes. Applied Mathematics and Computation 192 (2007) 233-238
10. Montellano-Ballesteros J.J., Neumann-Lara V., and Rivera-Campo E. On a heterochromatic number for hypercubes. Discrete Mathematics 177 (2008) 3441-3448
11. Tsai C.-H., and Lai Y.-C. Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes. Information Sciences 177 (2007) 5590-5597
12. Tutte W.T. The factorization of linear graphs. Journal of London Mathematical Society 22 (1947) 107-111
13. Wu R.-Y., Chen G.-H., Kuo Y.-L., and Chang G.J. Node-disjoint paths in hierarchical hypercube networks. Information Sciences 177 (2007) 4200-4207
14. Zhu Q., Liu S.-Y., and Xu M. On conditional diagnosability of the folded hypercubes. Information Sciences 178 (2008) 1069-1077
15. Zhu Q., Xu J.-M., Hou X., and Xu M. On reliability of the folded hypercubes. Information Sciences 177 (2007) 1782-1788