Abstract
Let G(sigma) = (G, sigma) be a signed graph and A(G, sigma) be its adjacency matrix. Denote by m(G) the matching number of G. Let eta(G, sigma) be the......
小提示:本篇文献需要登录阅读全文,点击跳转登录