The Cartesian product of graphs G and H is the graph \(G \Box H\) whose vertex set is \(V (G)\times V (H)\) and whose edge set is the set of all pairs \((u_1,v_1)(u_2,v_2)\) such that either \(u_1u_2 \in E(G)\) and \(v_1 = v_2\) , or \(v_1v_2 \in E(H)\) and \(u_1 = u_2\) . The multiple extended complete split-like graph \(MECS_{b,s}^{a}\) is the join graph of an empty graph \({\overline{K}}_a\) and s copies of \(K_b\Box K_2\) , where \(K_b\Box K_2\) is the Cartesian product of complete graphs \(K_b\) and \(K_2\) . In this paper, we derive the resistance distance and the number of spanning trees of multiple extended complete split-like graph.