Terminal Hosoya polynomial of line graphs
From MaRDI portal
Publication:2249941
Summary: The terminal Hosoya polynomial of a graph \(G\) is defined as \(\mathrm{TH}(G,\lambda)=\sum_{k\geq 1}d_T(G,k)\lambda^k\), where \(d_T(G,k)\) is the number of pairs of pendant vertices of \(G\) that are at distance \(k\). In this paper we obtain terminal Hosoya polynomial of line graphs.
Recommendations
Cites work
- Equiseparability on Terminal Wiener Index
- Hosoya polynomial of composite graphs
- scientific article; zbMATH DE number 1877035 (Why is no real title available?)
- scientific article; zbMATH DE number 6161924 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- On some counting polynomials in chemistry
- Some new results on the Hosoya polynomial of graph operations
- Terminal Hosoya polynomial of line graphs
- Terminal Wiener index
- Terminal Wiener index of line graphs
- The sum of the distances between the leaves of a tree and the `semi-regular' property
Cited in
(4)
This page was built for publication: Terminal Hosoya polynomial of line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249941)