Year: 2010
Type: article
Abstract: The matching preclusion number of a graph is the minimum \nnumber of edges whose deletion results in a graph that has neither \nperfect matchings nor almost-perfect matchings. For many interconnection \nnetworks, the optimal sets are precisely those induced by a \nsingle vertex. Recently, the conditional matching preclusion number \nof a graph was introduced to look for obstruction sets beyond those \ninduced by a single vertex. It is defined to be the minimum number \nof edges whose deletion results in a graph with no isolated vertices \nthat has neither perfect matchings nor almost-perfect matchings. In \nthis paper, we find the matching preclusion number and the conditional matching preclusion number for twisted cubes, an improved \nversion of the well-known hypercube. Moreover, we also classify all \nthe optimal matching preclusion sets.
Authors: Bhaskar, Ram, Cheng, Eddie, Liang, Mason, Pandey, Saurabh, Wang, Kevin
Institution: Oakland University
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1773033641