Hosoya polynomial of composite graphs (Q5937936): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 01:42, 30 January 2024

scientific article; zbMATH DE number 1621245
Language Label Description Also known as
English
Hosoya polynomial of composite graphs
scientific article; zbMATH DE number 1621245

    Statements

    Hosoya polynomial of composite graphs (English)
    0 references
    0 references
    28 November 2001
    0 references
    Given a connected graph \(G\), the Hosoya polynomial of \(G\) is \(H(G,x)= \frac{1}{2} \sum x^{d(u,v)}\) where the sum ranges over the set of all pairs of vertices \(u\neq v\). \textit{Y.-N. Yeh} and \textit{I. Gutman} [Discrete Math. 135, No. 1-3, 359-365 (1994; Zbl 0814.05033)] examined the Wiener number (the sum of distances between all pairs of vertices) of composite graphs (the sum, join, composition, corona, and cluster) of two graphs. In this paper their results are generalized by determining the Hosoya polynomial of these graphs.
    0 references
    0 references
    graph
    0 references
    distance
    0 references
    Hosoya polynomial
    0 references
    Wiener number
    0 references
    composite graph
    0 references

    Identifiers