{"product_id":"hosoya-polynomials-of-steiner-distance-of-some-graphs-von-herish-o-abdullah-und-ali-a-ali","title":"Hosoya Polynomials of Steiner Distance of Some Graphs","description":"\u003cp\u003eThe Steiner n-distance, d(S), of a non-empty n- subset S of vertices of a graph G is defined to be the size of the smallest connected subgraph T(S) containing S. The Hosoya polynomial of Steiner n- distance of a connected graph G is denoted by Hn* (G;x). In this work, we obtain Hosoya polynomials of Steiner n-distance(n is greater than or equal to 3 and less than or equal to the order of the graph) of some particular graphs; for other prescribed graphs, we obtain Hosoya polynomials of Steiner 3- distance. For some graphs G, we find reduction formulas for Hn*(G;x) or H3*(G;x). Wiener indices of the Steiner n-distance of most of the particular graphs and composite graphs considered here are also obtained. Moreover, the diameter of the Steiner n-distance for each one of these graphs is determined. Furthermore, Wiener index theorem for trees, which is due to H. Wiener, is generalized to Steiner n- distance of trees.\u003c\/p\u003e\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9783844391411\"\u003e\u003ch3\u003eHosoya Polynomials \u0026amp; Wiener Indices of Graphs\u003c\/h3\u003e\u003c\/div\u003e","brand":"Autorenwelt Shop","offers":[{"title":"Softcover - 9783844391411","offer_id":39471218688093,"sku":"9783844391411","price":68.0,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/70b9883f-07f5-4923-b630-c531af0d36f5.jpg?v=1757827125","url":"https:\/\/shop.autorenwelt.de\/products\/hosoya-polynomials-of-steiner-distance-of-some-graphs-von-herish-o-abdullah-und-ali-a-ali","provider":"Autorenwelt Shop","version":"1.0","type":"link"}