一些图的Hosoya多项式分解与拓扑指标.pdf

HosoyaRandi´c, Randi´c PISzeged. G = (V, E)dG (u, v)uv G,GHosoya H (G)={u,v}⊆V (G) xdG (u,v) ; GRandi´cRα (G) = uv ∈E α (d(u)d(v)) , d(u)u G α; GPISzeged (Sz) P I (G) = (n (e|G)+n (e|G)),Sz (G) = n (e|G)n (e|G), v e∈E (G) u v e∈E (G) u v n (e|G)u v n (e|G). u v . , Hosoya, ,Hosoya . star-like Randi´c Randi´c star-like Randi´c Randi´c . PISzeged PISzeged . Hosoya ; Randi´c; PI; Szeged III Abstract Topological index is defined as number descriptor on compound molecular (skeleton) graph. This thesis studies mainly the Hosoya polynomial decomposition and general Randi´c index for polyphenyls, and also investigates the general Randi´c index, vertex PI index and Szeged index for bridge and chain graphs. Suppose that G = (V, E) is a connected graph, and let dG (u, v) be the distance between u and v in G. Then the Hosoya polynomial of G is defined as H (G)={u,v}⊆V (G) xdG (u,v); the general Randi´c index is defined as R (G) = α α uv ∈E (d(u)d(v)) ,where α is an arbitrary real number and d(u) is the degree of u in G; the vertex Padmakar-Ivan (P Iv ) and Szeged (Sz) indices of a graph G are defined as P Iv (G) := (n (e|G) + n (e|G)) and e∈E (G) u v Sz (G) = nu (e|G)n (e|G) respectively, where n (e|G) is the number of vertices e∈E (G) v u lying closer to the vertex u than to the vertex v and nv (e|G) is