Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Sara Oskoueian"'
Publikováno v:
Mathematics Interdisciplinary Research, Vol 9, Iss 4, Pp 413-424 (2024)
Consider a graph $G=(V(G),E(G))$, where a perfect matching in $G$ is defined as a subset of independent edges with $\frac{|V(G)|}{2}$ elements. A global forcing set is a subset $S$ of $E$ such that no two disjoint perfect matchings of
Externí odkaz:
https://doaj.org/article/082a7185d79149c98ba776675c98da3e
