نتایج جستجو برای: randic incidence energy
تعداد نتایج: 905171 فیلتر نتایج به سال:
sufficient conditions on the zeroth-order general randic index for maximally edge-connected digraphs
let $d$ be a digraph with vertex set $v(d)$. for vertex $vin v(d)$, the degree of $v$,denoted by $d(v)$, is defined as the minimum value if its out-degree and its in-degree.now let $d$ be a digraph with minimum degree $deltage 1$ and edge-connectivity$lambda$. if $alpha$ is real number, then the zeroth-order general randic index is definedby $sum_{xin v(d)}(d(x))^{alpha}$. a digraph is maximall...
abstract. topological indices are the numerical value associated with chemical constitution purporting for correlation of chemical structure with various physical properties, chemical reactivity or biological activity. graph theory is a delightful playground for the exploration of proof techniques in discrete mathematics and its results have applications in many areas of sciences. a graph is a ...
Porous material such as metal-natural constructions and their particular partner poly-hydra are made up of inorganic clusters with no saturation exhibit great capability for utilization in the absorption gas ascending opening optics detecting biotechnology hardware. Cuboctahedral bi-metallic structure is an often-quoted example polyhedra class. In this study, we have calculated first second Zag...
Topological indices are the numerical value associated with chemical constitution purporting for correlation of chemical structure with various physical properties, chemical reactivity or biological activity. Graph theory is a delightful playground for the exploration of proof techniques in Discrete Mathematics and its results have applications in many areas of sciences. One of the useful indic...
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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید