Matching Preclusion Number of Radix Triangular Mesh with Odd Vertices

Abstract

The matching preclusion number of graph G is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching or almost-perfect matching. The strong matching preclusion number of a graph G is the minimum number of vertices and edges whose deletion leaves the resulting graph without a perfect matching or an almost-perfect matching. The conditional matching preclusion number of G is the minimum number of edges whose deletion leaves the resulting graph with no isolated vertices and without a perfect matching or almost-perfect matching. In this paper, we study the matching preclusion number of radix triangular mesh with an odd number of vertices, and strong matching preclusion number and conditional matching preclusion number of radix triangular mesh. Also, we obtained the radix triangular mesh with an even number of vertices is super strongly matched and conditionally super matched.