Title

Conditional Matching Preclusion for the Arrangement Graphs

Document Type

Article

Publication Date

2011

Publication Source

Theroretical Computer Science

Volume

412

Inclusive pages

6279 - 6289

Publisher

Elsevier

Peer Reviewed

yes

Abstract

The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently, the conditional matching preclusion number of a graph was introduced to look for obstruction sets beyond those induced by a single vertex. It is defined to be the minimum number of edges whose deletion results in a graph with no isolated vertices that has neither perfect matchings nor almost-perfect matchings. In this paper we find this number and classify all optimal sets for the arrangement graphs, one of the most popular interconnection networks.

Keywords

interconnection networks, perfect matching, Arrangement graphs

Disciplines

Discrete Mathematics and Combinatorics | Mathematics | OS and Networks

This document is currently not available here.

  Contact Author

Share

COinS