نتایج جستجو برای: 4 sum connectivity index
تعداد نتایج: 1761546 فیلتر نتایج به سال:
Let T ∆ n denote the set of trees of order n, in which the degree of each vertex is bounded by some integer ∆. Suppose that every tree in T ∆ n is equally likely. We show that the number of vertices of degree j in T ∆ n is asymptotically normal with mean (μj + o(1))n and variance (σj + o(1))n, where μj , σj are some constants. As a consequence, we give estimate to the value of the general Zagre...
The general Randić index Rα(G) is the sum of the weight d(u)d(v)α over all edges uv of a graph G, where α is a real number and d(u) is the degree of the vertex u of G. In this paper, for any real number α = 0, the first three minimum general Randić indices among trees are determined, and the corresponding extremal trees are characterized.
Let Tn denote the set of all unrooted and unlabeled trees with n vertices, and (i, j) a double-star. By assuming that every tree of Tn is equally likely, we show that the limiting distribution of the number of occurrences of the double-star (i, j) in Tn is normal. Based on this result, we obtain the asymptotic value of Randić index for trees. Fajtlowicz conjectured that for any connected graph ...
The m-connectivity index χα(G) of an organic molecule whose molecular graph is G is the sum of the weights (di1di2 ...dim+1) , where i1−i2− ...−im+1 runs over all paths of length m in G and di denotes the degree of vertex vi. We find upper bounds for χα(G) when m ≥ 1 and α ≥ −1 (α 6= 0) using the eigenvalues of the Laplacian matrix of an associated weighted graph.
We derived explicit formulae for the eccentric connectivity index and Wiener index of 2-dimensional square-octagonal TUC4C8(R) lattices with open and closed ends. New compression factors for both indices are also computed in the limit N-->∞.
The general Randić index Rα(G) of a (chemical) graph G, is defined as the sum of the weights (d(u)d(v))α of all edges uv of G, where d(u) denotes the degree of a vertex u in G and α an arbitrary real number, which is called the Randić index or connectivity index (or branching index) for α = −1/2 proposed by Milan Randić in 1975. The paper outlines the results known for the (general) Randić inde...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید