Sorry, we do not have enough data to show an influence graph for this author.
- Full text PDF available (1)
Journals and Conferences
The matching preclusion number of an even graph is the minimum number of edges whose deletion results in a graph that has no perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently, the conditional matching preclusion number of an even graph was introduced to look for obstruction sets… (More)