On the Higher Randić Index
author
Abstract:
Let G be a simple graph with vertex set V(G) {v1,v2 ,...vn} . For every vertex i v , ( ) i v represents the degree of vertex i v . The h-th order of Randić index, h R is defined as the sum of terms 1 2 1 1 ( ), ( )... ( ) i i ih v v v over all paths of length h contained (as sub graphs) in G . In this paper , some bounds for higher Randić index and a method for computing the higher Randic index of a simple graph is presented . Also, the higher Randić index of coronene/circumcoronene is computed.
similar resources
on the higher randić index
let g be a simple graph with vertex set v(g) {v1,v2 ,...vn} . for every vertex i v , ( ) i vrepresents the degree of vertex i v . the h-th order of randić index, h r is defined as the sumof terms1 2 11( ), ( )... ( ) i i ih v v vover all paths of length h contained (as sub graphs) in g . inthis paper , some bounds for higher randić index and a method for computing the higherrandic ind...
full textThe Smallest Randić Index for Trees
The general Randić index Rα(G) is the sum of the weight d(u)d(v)α over all edges uv of a graph G, where α is a real number and d(u) is the degree of the vertex u of G. In this paper, for any real number α = 0, the first three minimum general Randić indices among trees are determined, and the corresponding extremal trees are characterized.
full textThe Randić index and the diameter of graphs
The Randić index R(G) of a graph G is defined as the sum of 1 √dudv over all edges uv of G, where du and dv are the degrees of vertices u and v, respectively. Let D(G) be the diameter of Gwhen G is connected. Aouchiche et al. (2007) [1] conjectured that among all connected graphs G on n vertices the path Pn achieves the minimum values for both R(G)/D(G) and R(G) − D(G). We prove this conjecture...
full textRandić index, irregularity and complex biomolecular networks.
A new formulation of Randić index is carried out as a minimization of a quadratic form which involves the Laplacian matrix of a graph. Using this formulation it is easy to realize that Randić index is useful in defining a new index of irregularity, which is then formulated here. A new context for the study of irregularity of graphs is advanced as a necessity for studying complex (biological) ne...
full textRandić index and the diameter of a graph
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...
full textA note on the zeroth-order general randić index of cacti and polyomino chains
The present note is devoted to establish some extremal results for the zeroth-order general Randi'{c} index of cacti, characterize the extremal polyomino chains with respect to the aforementioned index, and hence to generalize two already reported results.
full textMy Resources
Journal title
volume 4 issue 2
pages 257- 263
publication date 2013-05-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023