(n, m)-Graphs with Maximum Zeroth-Order General Randic Index for α ∈ (−1, 0) ∗
暂无分享,去创建一个
Given a graph G =( V, E) and an arbitrary real number α, the zeroth-order general Randic index of the graph G is defined as 0Rα(G )= � u∈V (G) d(u) α , where the summation goes over all vertices of G and d(u) denotes the degree of u in G. In this paper, we characterize the simple connected (n, m)-graphs with the maximum zeroth-order general Randic index for α ∈ (−1, 0), which was left unsolved in our early paper published in Discrete Appl. Math.
[1] Sonja Nikolic,et al. The Vertex-Connectivity Index Revisited , 1998, J. Chem. Inf. Comput. Sci..
[2] M. Randic. Characterization of molecular branching , 1975 .
[3] Ljiljana Pavlovic. Maximal Value of the Zeroth-order Randic Index , 2003, Discret. Appl. Math..
[4] Béla Bollobás,et al. Graphs of Extremal Weights , 1998, Ars Comb..
[5] Xueliang Li,et al. Connected (n, m)-graphs with minimum and maximum zeroth-order general Randic index , 2007, Discret. Appl. Math..