Hosoya Polynomials of Steiner Distance of Some Graphs Hosoya Polynomials & Wiener Indices of Graphs
-
- Englisch ausgewählt
Fr. 91.90
inkl. gesetzl. MwSt.,
Beschreibung
Produktdetails
Einband
Taschenbuch
Erscheinungsdatum
20.05.2011
Verlag
LAP LAMBERT Academic PublishingSeitenzahl
180
Maße (L/B/H)
22/15/1.1 cm
Gewicht
286 g
Auflage
1. Auflage
Sprache
Englisch
ISBN
978-3-8443-9141-1
The 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.
Kundinnen und Kunden meinen
Verfassen Sie die erste Bewertung zu diesem Artikel
Helfen Sie anderen Kund*innen durch Ihre Meinung