Upper bounds for the number of perfect matchings in hexagonal systems are deduced, which depend on the number of vertices and edges. The results are obtained using graph spectral theory.