Abstract
Let G = (V, E) be a finite undirected graph without loops and multiple edges. A subset M subset of E of edges is a dominating induced matching (d.i.m.......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
