scholarly journals Limit laws for the Randić index of random binary tree models

2007 ◽  
Vol 60 (2) ◽  
pp. 319-343 ◽  
Author(s):  
Qunqiang Feng ◽  
Hosam M. Mahmoud ◽  
Alois Panholzer
Keyword(s):  
Binary Tree ◽  
Randić Index ◽  
Limit Laws ◽  
Randic Index ◽  
Tree Models

Second order Randić index of phenylenes and their corresponding hexagonal squeezes

2006 ◽  
Vol 42 (4) ◽  
pp. 941-947 ◽  
Author(s):  
Jie Zhang ◽  
Hanyuan Deng ◽  
Shubo Chen
Keyword(s):  
Second Order ◽  
Randić Index ◽  
Randic Index

scholarly journals Ordering of alkane isomers by means of connectivity indices

2002 ◽  
Vol 67 (2) ◽  
pp. 87-97 ◽  
Author(s):  
Ivan Gutman ◽  
Dusica Vidovic ◽  
Anka Nedic
Keyword(s):  
Carbon Atom ◽  
Organic Molecule ◽  
Molecular Graph ◽  
Connectivity Index ◽  
Randić Index ◽  
Randic Index ◽  
Connectivity Indices ◽  
The Difference

The connectivity index of an organic molecule whose molecular graph is Gis defined as C(?)=?(?u?v)??where ?u is the degree of the vertex u in G, where the summation goes over all pairs of adjacent vertices of G and where ? is a pertinently chosen exponent. The usual value of ? is ?1/2, in which case ?=C(?1/2) is referred to as the Randic index. The ordering of isomeric alkanes according to ??follows the extent of branching of the carbon-atom skeleton. We now study the ordering of the constitutional isomers of alkanes with 6 through 10 carbon atoms with respect to C(?) for various values of the parameter ?. This ordering significantly depends on ?. The difference between the orderings with respect to ??and with respect to C(?) is measured by a function ??and the ?-dependence of ??was established.

scholarly journals On the conjecture of Aouchiche and Hansen about the Randić index

2013 ◽  
Vol 313 (3) ◽  
pp. 225-235 ◽  
Author(s):  
Bolian Liu ◽  
Ljiljana R. Pavlović ◽  
Tomica R. Divnić ◽  
Jianxi Liu ◽  
Marina M. Stojanović
Keyword(s):  
Randić Index ◽  
Randic Index

scholarly journals Bounds on General Randić Index for F-Sum Graphs

2020 ◽  
Vol 2020 ◽  
pp. 1-17
Author(s):  
Xu Li ◽  
Maqsood Ahmad ◽  
Muhammad Javaid ◽  
Muhammad Saeed ◽  
Jia-Bao Liu
Keyword(s):  
Molecular Graph ◽  
Randić Index ◽  
Lower And Upper Bounds ◽  
First Zagreb Index ◽  
Zagreb Index ◽  
Randic Index ◽  
Structure Activity ◽  
General Randić Index ◽  
General Randic Index ◽  
The First Zagreb Index

A topological invariant is a numerical parameter associated with molecular graph and plays an imperative role in the study and analysis of quantitative structure activity/property relationships (QSAR/QSPR). The correlation between the entire π-electron energy and the structure of a molecular graph was explored and understood by the first Zagreb index. Recently, Liu et al. (2019) calculated the first general Zagreb index of the F-sum graphs. In the same paper, they also proposed the open problem to compute the general Randić index RαΓ=∑uv∈EΓdΓu×dΓvα of the F-sum graphs, where α∈R and dΓu denote the valency of the vertex u in the molecular graph Γ. Aim of this paper is to compute the lower and upper bounds of the general Randić index for the F-sum graphs when α∈N. We present numerous examples to support and check the reliability as well as validity of our bounds. Furthermore, the results acquired are the generalization of the results offered by Deng et al. (2016), who studied the general Randić index for exactly α=1.

scholarly journals First General Zagreb Index of Generalized F-sum Graphs

2020 ◽  
Vol 2020 ◽  
pp. 1-16 ◽  
Author(s):  
H. M. Awais ◽  
Muhammad Javaid ◽  
Akbar Ali
Keyword(s):  
Real Number ◽  
Cartesian Product ◽  
Randić Index ◽  
Zeroth Order ◽  
Zagreb Index ◽  
Randic Index

The first general Zagreb (FGZ) index (also known as the general zeroth-order Randić index) of a graph G can be defined as M γ G = ∑ u v ∈ E G d G γ − 1 u + d G γ − 1 v , where γ is a real number. As M γ G is equal to the order and size of G when γ = 0 and γ = 1 , respectively, γ is usually assumed to be different from 0 to 1. In this paper, for every integer γ ≥ 2 , the FGZ index M γ is computed for the generalized F-sums graphs which are obtained by applying the different operations of subdivision and Cartesian product. The obtained results can be considered as the generalizations of the results appeared in (IEEE Access; 7 (2019) 47494–47502) and (IEEE Access 7 (2019) 105479–105488).

Algorithms and complexity results for finding graphs with extremal Randić index

Networks ◽  
2016 ◽  
Vol 67 (4) ◽  
pp. 338-347 ◽  
Author(s):  
Rex K. Kincaid ◽  
Sarah J. Kunkler ◽  
Michael Drew Lamar ◽  
David J. Phillips
Keyword(s):  
Randić Index ◽  
Randic Index ◽  
Complexity Results ◽  
Algorithms And Complexity
Sign in / Sign up

Export Citation Format

Share Document