Some Bounds on Zeroth-Order General Randić Index
Keyword(s):
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.
Keyword(s):
Keyword(s):
2014 ◽
Vol 31
(1)
◽
pp. 182-195
◽
Keyword(s):
2010 ◽
Vol 49
(2)
◽
pp. 325-327
◽
Keyword(s):
2011 ◽
Vol 24
(5)
◽
pp. 687-691
◽
Keyword(s):
2007 ◽
Vol 155
(8)
◽
pp. 1044-1054
◽
Keyword(s):
2007 ◽
Vol 43
(2)
◽
pp. 737-748
◽
Keyword(s):
2019 ◽
Vol 16
(2)
◽
pp. 182-189
◽
Keyword(s):
Keyword(s):