Terminal Hosoya polynomial of line graphs (Q2249941)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6313254
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Terminal Hosoya polynomial of line graphs |
scientific article; zbMATH DE number 6313254 |
Statements
Terminal Hosoya polynomial of line graphs (English)
0 references
4 July 2014
0 references
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.
0 references
Hosoya polynomial of graph operations
0 references
0.8699843883514404
0 references
0.7889106273651123
0 references
0.7693833112716675
0 references
