In this paper we find the values of mp(T n ) and mp 1 (T n ) when n(n+1)≡0 (mod 4). Every minimum matching preclusion set in an n-triangular mesh network is trivial. Also, mp(G) ≤ δ(G), where δ(G) is the minimum degree of G and mp 1 (G) ≤ v e (G)
The matching preclusion number of a graph with an even number of vertices is the minimum number of e...
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a...
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a...
AbstractThe (conditional) matching preclusion number of a graph is the minimum number of edges whose...
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a...
AbstractThe matching preclusion number of an even graph is the minimum number of edges whose deletio...
AbstractThe matching preclusion number of a graph is the minimum number of edges whose deletion resu...
The matching preclusion number of a graph with an even number of vertices is the minimum number of e...
The matching preclusion number of a graph is the minimum number of edges whose deletion results in ...
AbstractThe matching preclusion number of a graph is the minimum number of edges whose deletion resu...
The matching preclusion number of a graph is the minimum number of neither edges whose deletion in a...
The matching preclusion number of a graph with an even number of vertices is the minimum number of e...
AbstractThe conditional matching preclusion number of a graph with n vertices is the minimum number ...
ABSTRACT. The matching preclusion number of a graph is the mini-mum number of edges whose deletion r...
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a...
The matching preclusion number of a graph with an even number of vertices is the minimum number of e...
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a...
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a...
AbstractThe (conditional) matching preclusion number of a graph is the minimum number of edges whose...
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a...
AbstractThe matching preclusion number of an even graph is the minimum number of edges whose deletio...
AbstractThe matching preclusion number of a graph is the minimum number of edges whose deletion resu...
The matching preclusion number of a graph with an even number of vertices is the minimum number of e...
The matching preclusion number of a graph is the minimum number of edges whose deletion results in ...
AbstractThe matching preclusion number of a graph is the minimum number of edges whose deletion resu...
The matching preclusion number of a graph is the minimum number of neither edges whose deletion in a...
The matching preclusion number of a graph with an even number of vertices is the minimum number of e...
AbstractThe conditional matching preclusion number of a graph with n vertices is the minimum number ...
ABSTRACT. The matching preclusion number of a graph is the mini-mum number of edges whose deletion r...
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a...
The matching preclusion number of a graph with an even number of vertices is the minimum number of e...
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a...
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a...
DOI
Add to ORKG