The Kulli path windmill graph P(m)n+1 is the graph obtained by taking m ? 2 copies of the graph K1 + Pn for n ? 4 with a vertex K1 in common. In this paper, we determine Zagreb, hyper-Zagreb, sum connectivity, general sum ...