Hosoya polynomials under gated amalgamations

An induced subgraph H of a graph G is gated if for every vertex x outside H there exists a vertex x^′ inside H such that each vertex y of H is connected with x by a shortest path passing through x^′. The gated amalgam of graphs G₁ and G₂ is obtained from G₁ and G₂ by identifying their isomorphic gated subgraphs H₁ and H₂. Two theorems on Hosoya polynomials of gated amalgams are provided. As their applications, explicit expressions for Hosoya polynomials of hexagonal chains are obtained.