نتایج جستجو برای: Randi'c index

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

2013
A. Iranmanesh

Recently, the subdivision Randic index was introduced. In this paper, we present new version of Randic index by using some graph operator and in related to the subdivision Randic index. Next, by using some results about this version, it is computed for TUC C (R) nanotubes. 4 8

2017
M. R. Rajesh Kanna

In this paper, we compute ABC index, Randic connectivity index, Sum connectivity index, GA index, Harmonic index, General Randic index of Triglyceride. AMS subject classification:

Journal: :Applicable Analysis and Discrete Mathematics 2017

2012
D. H. Rouvray W. Tatong

Several different topological indices (the carbon number, the Wiener index, the Balaban dis­ tance sum connectivity index, the Randic molecular identification number, and the Randic molecular connectivity indices °/, 2%, 3̂ p and 3/ c) were employed in the correlation of the velocity of ultrasonic sound in a variety of alkane and alcohol species. Using linear regression analyses and published so...

2015
Mahsa Hemmasi Ali Iranmanesh Milan Randic

In this paper, we present some new lower and upper bounds for the modified Randic index in terms of maximum, minimum degree, girth, algebraic connectivity, diameter and average distance. Also we obtained relations between this index with Harmonic and Atom-bond connectivity indices. Finally, as an application we computed this index for some classes of nano-structures and linear chains.

Journal: :iranian journal of mathematical chemistry 2015
s. klavžar e. deutsch

let $g$ be a graph and let $m_{ij}(g)$, $i,jge 1$, be the number of edges $uv$ of $g$ such that ${d_v(g), d_u(g)} = {i,j}$. the {em $m$-polynomial} of $g$ is introduced with $displaystyle{m(g;x,y) = sum_{ile j} m_{ij}(g)x^iy^j}$. it is shown that degree-based topological indices can be routinely computed from the polynomial, thus reducing the problem of their determination in each particular ca...

Journal: :Linear Algebra and its Applications 2021

We prove that, for any graph G, its energy is at least twice the Randic index. show that equality holds if and only G union of complete bipartite graphs.

Journal: :Kragujevac Journal of Science 2015

Journal: :communication in combinatorics and optimization 0
l. volkmann rwth aachen university

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

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

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