STRONG MATCHING PRECLUSION OF PANCAKE GRAPHS-Reference-Cited by-同舟云学术

STRONG MATCHING PRECLUSION OF PANCAKE GRAPHS

Published:2013-06 Issue:02 Volume:14 Page:1350007
ISSN:0219-2659
Container-title:Journal of Interconnection Networks
language:en
Short-container-title:J. Inter. Net.

Author:

CHENG EDDIE¹,LU DAVID²,XU BRIAN³

Affiliation:

1. Department of Mathematics and Statistics, Oakland University, Rochester, MI 48309, USA

2. Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139, USA

3. Detroit Country Day School, 22305 West Thirteen Mile Road, Beverly Hills, MI 48025, USA

Abstract

The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. This is an extension of the matching preclusion problem that was introduced by Park and Ihm. In this paper, we examine the properties of pancake graphs by finding its strong matching preclusion number and categorizing all optimal solutions.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Networks and Communications

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0219265913500072

Reference27 articles.

1. STRONG MATCHING PRECLUSION FOR THE ALTERNATING GROUP GRAPHS AND SPLIT-STARS

2. A comparative study of job allocation and migration in the pancake network

3. Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions

4. Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Conditional strong matching preclusion of the pancake graph;International Journal of Parallel, Emergent and Distributed Systems;2022-04-20

2. A general approach to deriving diagnosability results of interconnection networks*;International Journal of Parallel, Emergent and Distributed Systems;2022-04-18

3. A note on the strong matching preclusion problem for data center networks;Information Processing Letters;2020-12

4. Unexplored features of Ru(ii) polypyridyl complexes – towards combined cytotoxic and antimetastatic activity;Metallomics;2020-03-30

5. A Concise Survey of Matching Preclusion in Interconnection Networks;Journal of Interconnection Networks;2019-09