The Hosoya polynomial of distance-regular graphs
From MaRDI portal
(Redirected from Publication:741545)
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 5005356 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 6271715 (Why is no real title available?)
- Computing the Hosoya polynomial of graphs from primary subgraphs
- Hosoya polynomial of composite graphs
- Hosoya polynomials of circumcoronene series
- On some counting polynomials in chemistry
- Relationship between the Hosoya polynomial and the hyper-Wiener index
- Wiener index and Hosoya polynomial of Fibonacci and Lucas cubes
- Wiener index of trees: Theory and applications
Cited in
(5)- scientific article; zbMATH DE number 7410256 (Why is no real title available?)
- The Hosoya polynomial of double weighted graphs
- Homotopy in \(Q\)-polynomial distance-regular graphs
- Distance and eccentric sequences to bound the Wiener index, Hosoya polynomial and the average eccentricity in the strong products of graphs
- A class of distance-regular graphs that are \(\phi\)-polynomial
This page was built for publication: The Hosoya polynomial of distance-regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q741545)