نتایج جستجو برای: multiple zagreb indices
تعداد نتایج: 837989 فیلتر نتایج به سال:
The rst Zagreb index of a graph is equal to the sum of the square of the vertex degrees of the graph and the forgotten topological index (Findex) of a graph is de ned as the sum of cubes of the vertex degrees of the graph. These parameters have applications in chemistry and drug structures. For any xed integer d ≥ 2, the d-ary tree is a rooted tree in which each node has no more than d children...
Given a tree T = (V,E), the second Zagreb index of T is denoted by M2(T ) = ∑ uv∈E d(u)d(v) and the Wiener polarity index of T is equal to WP (T ) = ∑ uv∈E(d(u)−1)(d(v)−1). Let π = (d1, d2, ..., dn) and π′ = (d1, d2, ..., dn) be two different non-increasing tree degree sequences. We write π π′, if and only if ∑n i=1 di = ∑n i=1 d ′ i, and ∑j i=1 di ≤ ∑j i=1 d ′ i for all j = 1, 2, ..., n. Let Γ...
The F-index of a graph is defined as the sum of cubes of the vertex degrees of the graph which was introduced in 1972, in the same paper where the first and second Zagreb indices were introduced. In this paper we study the F-index of four operations on graphs which were introduced by Eliasi and Taeri [M. Eliasi, B. Taeri, Four new sums of graphs and their Wiener indices, Discrete Appl. Math.157...
A recently published paper [T. Došlić, this journal 3 (2012) 25-34] considers the Zagreb indices of benzenoid systems, and points out their low discriminativity. We show that analogous results hold for a variety of vertex-degree-based molecular structure descriptors that are being studied in contemporary mathematical chemistry. We also show that these results are straightforwardly obtained by u...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید