Terminal Hosoya polynomial of line graphs (Q2249941): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2013/857908 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1979478707 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58920207 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On some counting polynomials in chemistry / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4921399 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4796694 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4913983 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hosoya polynomial of composite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Terminal Wiener index / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equiseparability on Terminal Wiener Index / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5403551 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The sum of the distances between the leaves of a tree and the `semi-regular' property / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Terminal Hosoya polynomial of line graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5572939 / rank | |||
Normal rank |
Latest revision as of 17:00, 8 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Terminal Hosoya polynomial of line graphs |
scientific article |
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