The　minimal　energy　of　unicyclic　Hackel　molecular　graphs　with　Kekule　structures,　i.e.,　unicyclic　graphs　with　perfect　matchings,　of　which　all　vertices　have　degrees　less　than　four　in　graph　theory,　is　investigated.　The　set　of　these　graphs　is　denoted　by　H-n(l),　such　that　for　any　graph　in　H-n(l),　n　is　the　number　of　vertices　of　the　graph　and　1　the　number　of　vertices　of　the　cycle　contained　in　the　graph.　For　a　given　n(n　＞=　6),　the　graphs　with　minimal　energy　of　H-n(l)　have　been　discussed.