On the palindromic Hosoya polynomial of trees

Dmitry Badulin, Alexandr Grebennikov, Konstantin Vorob'ev

A graph $G$ on $n$ vertices of diameter $D$ is called $H$-palindromic if $\alpha (G,k)=\alpha (G,D-k)$ for all $k=0,1,\dots ,\lfloor \frac{D}{2}\rfloor$, where $\alpha (G,k)$ is th…