Let G be a graph of order n. The incidence energy IE(G) of graph G, IE for short, is defined as the sum of all singular values of its incidence matrix. In this paper, we determine the maximal incidence energy IE(G) among all connected graphs with the connectivity κ and edge connectivity κ' and Kκ' ∨(K1∪Kn-κ'-1) has the maximal incidence energy.