On graphs with $1$-matching and $2$-matching edges

Yixuan Gao, Xiumei Wang, Jinfeng Liu

Let \(G\) be a graph admitting a perfect matching. An edge is called a {\it \(k\)-matching edge} if it belongs to exactly \(k\) perfect matchings, and a {\it \(k^{+}\)-matching edg…