Abstract
A graph G of order n is implicit claw-heavy if in every induced copy of K-1,K-3 in G there are two non-adjacent vertices with sum of their implicit de......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
