Genetic Algorithm for Finding the Global Forcing Number of Bipartite Graphs
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 $G$ coincide on it. The minimum cardinality of global forc...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Kashan
2024-12-01
|
| Series: | Mathematics Interdisciplinary Research |
| Subjects: | |
| Online Access: | https://mir.kashanu.ac.ir/article_114587_4bbc4481b71a33e5339aa3d938a8b404.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|