A graph G = (V, E) is called a split graph if there exists a partition V = I U K such that the subgraphs G[l] and G[K] of G induced by I and K are empty and complete graphs, respectively. Burkard and Hammer gave a necessary condition for a split graph G with III IKI to be Hamiltonian (1. Comb. Theory, Ser. B 28:245-248, 1980). the authors will call a split graph G with |I| |K| satisfying this condition a Burkard-Hammer graph. Further, a split graph G is called a maximal nonhamiltonian split graph if G is nonhamiltonian but G + uv is Hamiltonian for every uv C E, where u C I and v C K. N.D. Tan and L.X. Hung have classified maximal nonhamiltonian Burkard-Hammer graphs G with minimum degree delta(G) or = |I| - 3. Recently, N.D. Tan and Iamjaroen have classified maximal nonhamiltonian Burkard-Hammer graphs with |I| = 6, 7 and delta(G) = |I| - 4. In this paper, the authors complete the classification of maximal nonhamiltonian Burkard-Hammer graphs with delta(G) = |I|- 4 by finding all such graphs for the case |I| = 6, 7.