The Hosoya polynomial of distance-regular graphs
Emeric Deutsch, Juan A. Rodriguez-Velazquez

TL;DR
This paper derives an explicit formula for the Hosoya polynomial of distance-regular graphs, including strongly regular graphs, using their intersection array, simplifying the computation of this graph invariant.
Contribution
It provides a new explicit formula linking the Hosoya polynomial to the intersection array of distance-regular graphs, including strongly regular graphs.
Findings
Explicit formula for Hosoya polynomial of distance-regular graphs
Simplified formula for strongly regular graphs
Facilitates easier computation of Hosoya polynomial
Abstract
In this note we obtain an explicit formula for the Hosoya polynomial of any distance-regular graph in terms of its intersection array. As a consequence, we obtain a very simple formula for the Hosoya polynomial of any strongly regular graph.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Advanced Combinatorial Mathematics · Finite Group Theory Research
