Let G be a graph with vertex set V and edge set E. Let d(i) be the degree of the vertex v(i) of G. The inverse degree, Randic index, and harmonic index of G are defined as I D = Sigma v(i)epsilon V-1/di, R = Sigma v(i)v(j) epsilon E 1/root d(i)d(j) , and H = Sigma v(i)v(j) epsilon E 2/(d(i) + d(j)), respectively. We obtain relations between ID and R as well as between ID and H. Moreover, we prove that in the case of trees, ID > R and ID > H.
机构:
Guangdong Univ Foreign Studies, Cisco Sch Informat, Guangzhou 510006, Guangdong, Peoples R ChinaS China Normal Univ, Sch Math Sci, Guangzhou 510631, Guangdong, Peoples R China
Liu, Jianxi
Liang, Meili
论文数: 0引用数: 0
h-index: 0
机构:
S China Normal Univ, Sch Math Sci, Guangzhou 510631, Guangdong, Peoples R ChinaS China Normal Univ, Sch Math Sci, Guangzhou 510631, Guangdong, Peoples R China
Liang, Meili
Cheng, Bo
论文数: 0引用数: 0
h-index: 0
机构:
Guangdong Univ Foreign Studies, Cisco Sch Informat, Guangzhou 510006, Guangdong, Peoples R ChinaS China Normal Univ, Sch Math Sci, Guangzhou 510631, Guangdong, Peoples R China
Cheng, Bo
Liu, Bolian
论文数: 0引用数: 0
h-index: 0
机构:
S China Normal Univ, Sch Math Sci, Guangzhou 510631, Guangdong, Peoples R ChinaS China Normal Univ, Sch Math Sci, Guangzhou 510631, Guangdong, Peoples R China
机构:
S China Normal Univ, Dept Math, Guangzhou 510631, Guangdong, Peoples R China
Guangdong Univ Technol, Fac Appl Math, Guangzhou 510090, Guangdong, Peoples R ChinaS China Normal Univ, Dept Math, Guangzhou 510631, Guangdong, Peoples R China
Li, Jianping
Zhou, Bo
论文数: 0引用数: 0
h-index: 0
机构:
S China Normal Univ, Dept Math, Guangzhou 510631, Guangdong, Peoples R ChinaS China Normal Univ, Dept Math, Guangzhou 510631, Guangdong, Peoples R China