scholarly journals On zeroth-order general Randić index of quasi-tree graphs containing cycles

2010 ◽  
Vol 7 (3) ◽  
pp. 93-98 ◽  
Author(s):  
Shengning Qiao
Keyword(s):  
Randić Index ◽  
Zeroth Order ◽  
Randic Index ◽  
Tree Graphs ◽  
General Randić Index ◽  
General Randic Index

scholarly journals Connected (n,m)-graphs with minimum and maximum zeroth-order general Randić index

2007 ◽  
Vol 155 (8) ◽  
pp. 1044-1054 ◽  
Author(s):  
Yumei Hu ◽  
Xueliang Li ◽  
Yongtang Shi ◽  
Tianyi Xu
Keyword(s):  
Randić Index ◽  
Zeroth Order ◽  
Randic Index ◽  
General Randić Index ◽  
General Randic Index

scholarly journals Some Bounds on Zeroth-Order General Randić Index

Mathematics ◽  
2020 ◽  
Vol 8 (1) ◽  
pp. 98 ◽  
Author(s):  
Muhammad Kamran Jamil ◽  
Ioan Tomescu ◽  
Muhammad Imran ◽  
Aisha Javed
Keyword(s):  
Clique Number ◽  
Upper Bounds ◽  
Randić Index ◽  
Extremal Graphs ◽  
Lower And Upper Bounds ◽  
Zeroth Order ◽  
Randic Index ◽  
General Randić Index ◽  
Inverse Degree ◽  
General Randic Index

For a graph G without isolated vertices, the inverse degree of a graph G is defined as I D ( G ) = ∑ u ∈ V ( G ) d ( u ) − 1 where d ( u ) is the number of vertices adjacent to the vertex u in G. By replacing − 1 by any non-zero real number we obtain zeroth-order general Randić index, i.e., 0 R γ ( G ) = ∑ u ∈ V ( G ) d ( u ) γ , where γ ∈ R − { 0 } . Xu et al. investigated some lower and upper bounds on I D for a connected graph G in terms of connectivity, chromatic number, number of cut edges, and clique number. In this paper, we extend their results and investigate if the same results hold for γ < 0 . The corresponding extremal graphs have also been identified.

Sign in / Sign up

Export Citation Format

Share Document