Terminal Hosoya polynomial of line graphs (Q2249941)

From MaRDI portal
Revision as of 18:00, 8 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    Hosoya polynomial of graph operations
    0 references
    0 references
    0 references