A Note on Signed k-Submatching in Graphs

S. Akbari, M. Dalirrooyfard, K. Ehsani +1

Let $G$ be a graph of order $n$. For every $v\in V(G)$, let $E_G(v)$ denote the set of all edges incident with $v$. A signed $k$-submatching of $G$ is a function $f:E(G)\longrighta…