On the lower and upper bounds for general Randić index of chemical (n, m)-graphs

Match

Volumn , Issue 52, 2004, Pages 157-166

  Li, Xueliang ^a,b   Wang, Xueqin ^a   Wei, Bing ^a  

^a UNIVERSITY OF MISSISSIPPI   (United States)

^b NANKAI UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; CALCULATION; CHEMICAL ANALYSIS; MATHEMATICAL COMPUTING; MATHEMATICAL MODEL;

EID: 7644242719     PISSN: 03406253     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (6)

1. BOLLOBAS, B., ERDÖS, P., Graphs of extremal weights, Ars Combin. 50 (1998), 225-233.
2. CLARK, L. H., MOON, J. W., On the general Randić index for certain families of trees Ars Combin. 54 (2000), 223-235.
3. GUTMAN, I., ARAUJO, O., MORALES, D. A., Bounds for the Randić connectivity index, J. Chem. Inf. Comput. Sci. 40(2000), 593-598.
4. GUTMAN, I., ARAUJO, O., MORALES, D. A., Estimating the connectivity index of a saturated hydrocarbon, Indian J. Chem. 39A (2000), 381-385.
5. -1 of chemical trees, Accepted for publication in MATCH Commun. Math. Comput. Chem.
6. RANDIĆ, M., On characterization of molecular branching, J. Am. Chem. Soc. 97(1975), 6609-6615.