نتایج جستجو برای: order general randic index
تعداد نتایج: 1881169 فیلتر نتایج به سال:
Earlier attempts to assess the complexity of molecules are analyzed and summarized in a number of definitions of general and topological complexity. A concept which specifies topological complexity as overall connectivity, and generalizes the idea of molecular connectivities of Randic, Kier, and Hall, is presented. Two overall connectivity indices, TC and TC1, are defined as the connectivity (t...
In this paper, we show that in the class of connected graphs G of order n ≥ 3 having girth at least equal to k, 3 ≤ k ≤ n, the unique graph G having minimum general sum-connectivity index χα(G) consists of Ck and n−k pendant vertices adjacent to a unique vertex of Ck, if−1 ≤ α < 0. This property does not hold for zeroth-order general Randić index Rα(G).
let $g$ be a simple graph with vertex set $v(g) = {v_1, v_2,ldots, v_n}$ and edge set $e(g) = {e_1, e_2,ldots , e_m}$. similar tothe randi'c matrix, here we introduce the randi'c incidence matrixof a graph $g$, denoted by $i_r(g)$, which is defined as the$ntimes m$ matrix whose $(i, j)$-entry is $(d_i)^{-frac{1}{2}}$ if$v_i$ is incident to $e_j$ and $0$ otherwise. naturally, therandi'c incidenc...
objective: the neck circumference (nc) as an index of obesity and upper-body subcutaneous adipose tissue distribution is recently used. this alternative screening tool is reliable, simple, quick and acceptable for assessment of overweight and obesity. the objectives of this study were to examine the correlation between nc measurement and diagnosis of general/visceral obesity and determining the...
We prove a version of the Doob Meyer decomposition for supermartingales with a linearly ordered index set. Key words Doob Meyer decomposition, natural increasing processes, potentials, supermartingales. Mathematics Subject Classi cation (2000): : 28A12, 60G07, 60G20.
let $g$ be a non-abelian group and let $z(g)$ be the center of $g$. associate with $g$ there is agraph $gamma_g$ as follows: take $gsetminus z(g)$ as vertices of$gamma_g$ and joint two distinct vertices $x$ and $y$ whenever$yxneq yx$. $gamma_g$ is called the non-commuting graph of $g$. in recent years many interesting works have been done in non-commutative graph of groups. computing the clique...
In this paper, first a simplified version of a general fuzzy automaton with a fixed c is defined and then a subepisode of a simplified version of a general fuzzy automaton with a constant c is defined and explained connected and strong connected them, and finally, a model of quasi-order hypergroup on general fuzzy automaton with constant c is presented and the relationships between them are rev...
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.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید