نتایج جستجو برای: randić index
تعداد نتایج: 396100 فیلتر نتایج به سال:
A chemical (n,m)-graph is a connected graph of order n, size m and maximum degree at most 4. The general Randić index of a graph is defined as the sum of the weights [d(u)d(v)]α of all edges uv of the graph, where α is any real number and d(u) is the degree of a vertex u. In this paper, we give the lower and upper bounds for general Randić index of chemical (n,m)-graphs. A graph of order n and ...
The general Randić index Rα(G) is the sum of the weights (dG(u)dG(v)) over all edges uv of a (molecular) graph G, where α is a real number and dG(u) is the degree of the vertex u of G. In this paper, for any real number α ≤ −1, the minimum general Randić index Rα(T ) among all the conjugated trees (trees with a Kekulé structure) is determined and the corresponding extremal conjugated trees are ...
The Randić index of an organic molecule whose molecular graph is G is defined as the sum of (d(u)d(v))−1/2 over all pairs of adjacent vertices of G, where d(u) is the degree of the vertex u in G. In Discrete Mathematics 257, 29–38 by Delorme et al. gave a best-possible lower bound on the Randić index of a triangle-free graph G with given minimum degree δ(G). In the paper, we first point out a m...
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.
The Randić index, R, also known as the connectivity or branching index, is an important topological index in chemistry. In order to attack some conjectures concerning the Randić index, Dvořák et al. [European J. Combin. 32 (2011), 434–442] introduced a modification of this index, denoted by R′. In this paper we present some of the basic properties of R′. We determine graphs with minimal and max...
wiener index is a topological index based on distance between every pair of vertices in agraph g. it was introduced in 1947 by one of the pioneer of this area e.g, harold wiener. inthe present paper, by using a new method introduced by klavžar we compute the wiener andszeged indices of some nanostar dendrimers.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید