Let G be a graph and d v denote the degree of the vertex v in G. The zeroth-order general Randić index of a graph is defined as R 0α (G) = ∑ v∈V(G) d α v where α is an arbitrary real number. In this paper, we obtained the lower and upper bounds for the zeroth-order general Randić index R 0α (G) among all unicycle graphs G of order n. We give a clear picture for R 0α (G) of unicycle graphs according to real number α in different intervals.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Li X., and Zhao H. (2004). MATCH Commun. Math. Comput. Chem 51:205
Araujo O., and Rada J. (2000). J. Math. Chem 27:19
Esrrada E. (2001). Chem. Phs. Lett 336:248
Fishermann M., Gutman I., Hoffmann A., Rautenbach D. Vidoić D. and Volkmann L. (2002). Z. Naturforsch 57a:49
Hansen P., and Mélot H. (2003). J. Chem. Inf Comput Sci 43:1
Gutman I., and Miljković O. (1999). Chem Phs Lett 306:366
Randić M. (1975). J. Am. Chem. Soc 97:6609
Randić M. (1998). J. Math. Chem 24:345
Pavlovič L. (2003). Discrete Applied Mathematics 127:615
Kier L.B., and Hall L. (1986). Molecular Connectivity in Structure Activity Analysis. Research Studies Press, Wiley UK
Yu P. (1998). J. Math Study (Chinese) 31:225
Bollobás B. and Erdös P. (1998). Ars Combin. 5:225
Li X., and Yang Y. (2004). MATCH Commun. Math. Comput. Chem 51:155
Li X., and Zheng J. (2005). MATCH Commun. Math. Comput. Chem. 51:195
Y. Hu et al., On molecular graphs with smallest and greatest zeroth-order general Randić index, Manuscript.
H. Wang, and H. Deng, Accepted by J. Math. Chem.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hua, H., Deng, H. On Unicycle Graphs with Maximum and Minimum Zeroth-order Genenal Randić Index. J Math Chem 41, 173–181 (2007). https://doi.org/10.1007/s10910-006-9067-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10910-006-9067-z