Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Chittesh Thavamani"'
Publikováno v:
International Journal of Computer Mathematics: Computer Systems Theory. 4:1-15
A strong matching preclusion set in a graph is a set of vertices and edges whose removal leaves the graph with no perfect matchings or almost perfect matchings. The strong matching preclusion numbe...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fb56a99a90a99526273b5ab23625523f
https://doi.org/10.1080/23799927.2018.1552991
https://doi.org/10.1080/23799927.2018.1552991
