Let G=(V,E) be a graph set with vertex set V and edge set E. The lollipop graph L(n,k) is a class of special unicyclic graphs which comes from joining a vertex of Pn-k to one vertex v of the cycle Ck. The degree distance of L(n,k) is investigated.