نتایج جستجو برای: randic incidence matrix
تعداد نتایج: 599614 فیلتر نتایج به سال:
The Generalised Randić index R−α(T ) of a tree T is the sum over the edges uv of T of (d(u)d(v))−α where d(x) is the degree of the vertex x in T . For all α > 0, we find the minimal constant βc = βc(α) such that for all trees on at least 3 vertices R−α(T ) ≤ βc(n + 1) where n = |V (T )| is the number of vertices of T . For example, when α = 1, βc = 15 56 . This bound is sharp up to the additive...
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 zeroth-order general Randic index, 0R?(G), of a connected graph G, is defined as 0 P R?(G) = ni =1 d?i , where di the degree vertex vi G and ? arbitrary real number. We consider linear combinations 0R?(G) form (? + ?)0R??1(G) ?? 0R??2(G) 2a 0R??1(G) a2 0R??2(G), an number, determine their bounds. As corollaries, various upper lower bounds indices that represent some special cases are obtain...
Let G = (V, E), V {v1, v2,..., vn}, be a simple connected graph of order n and size m, without isolated vertices. Denote by d1 ? d2 ?... dn, di d(vi) sequence vertex degrees G. The general zeroth-order Randic index is defined as 0R?(G) ?ni =1 d?i, where an arbitrary real number. corresponding coindex via 0R??(G) ?ni=1(n?1?di)d?i. Some new bounds for the relationship between 0R??(G?) 0R???1(G?) ...
in this paper an algorithm for computing the balaban and randic indices of any simple connected graph was introduced. also these indices were computed for ipr c80 fullerene isomers, zigzag nanotubes and graphene by gap program.
We define incidence matrices to be zero-one matrices with no zero rows or columns. We are interested in counting incidence matrices with a given number of ones, irrespective of the number of rows or columns. A classification of incidence matrices is considered for which conditions of symmetry by transposition, having no repeated rows/columns, or identification by permutation of rows/columns are...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید