In collaboration with Payame Noor University and Iranian Society of Instrumentation and Control Engineers
Global Forcing Number for Maximal Matchings under Graph Operations

Mostafa Tavakolli

Volume 4, Issue 1 , July 2019, , Pages 53-63

https://doi.org/10.30473/coam.2020.51754.1138

Abstract
  Let $S= \{e_1,\,e_2‎, ‎\ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$‎. ‎The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the‎ ‎vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$‎, ‎where $d_i=1$ if $e_i\in M$ and $d_i=0$‎ ...  Read More