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

Authors:
Yumei Hu;Xueliang Li;Yongtang Shi;Tianyi Xu
Affiliations:
Center for Combinatorics and LPMC, Nankai University, Tianjin 300071, PR China and Department of Mathematics, Tianjin University, Tianjin 300072, PR China;Center for Combinatorics and LPMC, Nankai University, Tianjin 300071, PR China;Center for Combinatorics and LPMC, Nankai University, Tianjin 300071, PR China;Center for Combinatorics and LPMC, Nankai University, Tianjin 300071, PR China
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 4
Cited 4

Extremal graphs for weights

Discrete Mathematics
Maximal value of the zeroth-order Randić index

Discrete Applied Mathematics
Graph Theory With Applications

Graph Theory With Applications
Brief Communication: Graphs with maximum connectivity index

Computational Biology and Chemistry

Note: The minimum degree distance of graphs of given order and size

Discrete Applied Mathematics
More on "Connected (n, m)-graphs with minimum and maximum zeroth-order general Randić index"

Discrete Applied Mathematics
Note: Sharp bounds of the zeroth-order general Randić index of bicyclic graphs with given pendent vertices

Discrete Applied Mathematics
Sharp bounds on the zeroth-order general Randić indices of conjugated bicyclic graphs

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.05

Visualization

Abstract

Let G be a graph and d(v) denote the degree of a vertex v in G. Then the zeroth-order general Randic index R@a0(G) of the graph G is defined as @?"v"@?"V"("G")d(v)^@a, where @a is a pertinently chosen real number. We characterize, for any @a, the connected (n,m)-graphs with minimum and maximum R@a0.