On minimally 1-tough $(K_1\cup P_4)$-free graphs | Digital Library | PAMCET | PAMCET