52 citations · 100 across the 32 of their papers we have counts for
1 paper · 1 filter
Bo Ning, Shenggui Zhang, Binlong Li
A graph G is called \emph{claw-o-heavy} if every induced claw (K1,3) of G has two end-vertices with degree sum at least ∣V(G)∣ in G. For a given graph R, G is call…