Aline Ribeiro de Almeida

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The matching preclusion number of a graph G, mp(G), is the minimum number of edges whose deletion leaves a resulting graph that has neither perfect matchings nor almost perfect matchings. Besides its theoretical linkage with conditional connectivity and ex-tremal graph theory, the matching preclusion number is a measure of robustness in interconnection(More)
  • 1