نتایج جستجو برای: randic index general sum connectivity index

تعداد نتایج: 1209035  

Journal: :Eur. J. Comb. 2011
Zdenek Dvorak Bernard Lidický Riste Skrekovski

The Randić index R(G) of a nontrivial connected graph G is defined as the sum of the weights (d(u)d(v))− 1 2 over all edges e = uv ofG. We prove that R(G) ≥ d(G)/2, where d(G) is the diameter of G. This immediately implies that R(G) ≥ r(G)/2, which is the closest result to the well-known Grafiti conjecture R(G) ≥ r(G) − 1 of Fajtlowicz [4], where r(G) is the radius of G. Asymptotically, our res...

Based on the Randic suggestion of the resolution of a structure into shape, size, and function an index representing structure-catabolic fate relationships of amino acids is constructed. The index obtained by multiplying three factors; (nb2 + nr), nc and M; representing shape, size and function respectively, where nb2 = number of double bonds, nr = number of rings, nc = number of carbon atoms, ...

2015
F. SHAFIEI IVAN GUTMAN

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...

Journal: :Discrete Applied Mathematics 2006

Journal: :Chemical Physics Letters 2011

2014
Lihua YOU Xin DONG

The Balaban index of a connected graph G is defined as J(G) = |E(G)| μ+ 1 ∑ e=uv∈E(G) 1 √ DG(u)DG(v) , and the Sum-Balaban index is defined as SJ(G) = |E(G)| μ+ 1 ∑ e=uv∈E(G) 1 √ DG(u)+DG(v) , where DG(u) = ∑ w∈V (G) dG(u,w), and μ is the cyclomatic number of G. In this paper, the unicyclic graphs with the maximum Balaban index and the maximum Sum-Balaban index among all unicyclic graphs on n v...

Journal: :CoRR 2015
Hosam Abdo Darko Dimitrov Ivan Gutman

In a study on the structure–dependency of the total π-electron energy from 1972, Trinajstić and one of the present authors have shown that it depends on the sums ∑ v∈V d(v) 2 and ∑ v∈V d(v) , where d(v) is the degree of a vertex v of the underling molecular graph G. The first sum was later named first Zagreb index and over the years became one of the most investigated graph–based molecular stru...

Journal: :Journal of Combinatorial Theory, Series A 1981

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید