On the palindromic Hosoya polynomial of trees
From MaRDI portal
Publication:5050719
Abstract: A graph on vertices of diameter is called -palindromic if for all , where is the number of unordered pairs of vertices at distance . Quantities form coefficients of the Hosoya polynomial. In 1999, Caporossi, Dobrynin, Gutman and Hansen showed that there are exactly five -palindromic trees of even diameter and conjectured that there are no such trees of odd diameter. We prove this conjecture for bipartite graphs. An infinite family of -palindromic trees of diameter is also constructed.
Recommendations
Cites work
- scientific article; zbMATH DE number 886138 (Why is no real title available?)
- Mathematical aspects of Wiener index
- On some counting polynomials in chemistry
- On the palindromic Hosoya polynomial of trees
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- Wiener index of hexagonal systems
- Wiener index of trees: Theory and applications
This page was built for publication: On the palindromic Hosoya polynomial of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5050719)