Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs

Bo Ning, Shenggui Zhang, Bing Chen

Let claw be the graph $K_{1,3}$. A graph $G$ on $n\ge 3$ vertices is called \emph{o}-heavy if each induced claw of $G$ has a pair of end-vertices with degree sum at least $n$, and…