For a graph we denote by the distance between vertices and in , by the degree of vertex . The Hosoya polynomial of is . For any positive numbers and , the partial Hosoya polynomials of are , . It has been shown that and for arbitrary hexagonal chains and with the same number of hexagons. As a corollary, we give an affine relationship between and other two distance-based polynomials constructed by Gutman [I. Gutman, Some relations between distance-based polynomials of trees, Bull. Acad. Serbe Sci. Arts (Cl. Math. Natur.) 131 (2005) 1–7].