Let G be an undirected simple, connected graph with n >= 3 vertices and m edges, with vertex degree sequence d >= d 2 >=....>= d n. The general Randic index is de fi ned by R-1 = Sigma((i,j)subset of E) 1/d(i)d(j) Lower and upper bounds for R-1 are obtained in this paper.
机构:
United Arab Emirates Univ, Dept Math Sci, POB 15551, Al Ain, U Arab EmiratesUnited Arab Emirates Univ, Dept Math Sci, POB 15551, Al Ain, U Arab Emirates
Imran, Muhammad
Akhter, Shehnaz
论文数: 0引用数: 0
h-index: 0
机构:
Natl Univ Sci & Technol NUST, Sch Nat Sci SNS, Dept Math, Sect H-12, Islamabad, PakistanUnited Arab Emirates Univ, Dept Math Sci, POB 15551, Al Ain, U Arab Emirates
Akhter, Shehnaz
Shaker, Hani
论文数: 0引用数: 0
h-index: 0
机构:
COMSATS Univ Islamabad, Dept Math, Lahore Campus, Lahore, PakistanUnited Arab Emirates Univ, Dept Math Sci, POB 15551, Al Ain, U Arab Emirates
机构:
Nankai Univ, Sch Math Sci, Tianjin 300071, Peoples R China
Nankai Univ, LPMC, Tianjin 300071, Peoples R ChinaNankai Univ, Sch Math Sci, Tianjin 300071, Peoples R China
Cui, Risheng
Jin, Guangzhi
论文数: 0引用数: 0
h-index: 0
机构:
Yanbian Univ, Coll Sci, Dept Math, Yanbian 133002, Jilin, Peoples R ChinaNankai Univ, Sch Math Sci, Tianjin 300071, Peoples R China
Jin, Guangzhi
Jin, Yinglie
论文数: 0引用数: 0
h-index: 0
机构:
Nankai Univ, Sch Math Sci, Tianjin 300071, Peoples R China
Nankai Univ, LPMC, Tianjin 300071, Peoples R ChinaNankai Univ, Sch Math Sci, Tianjin 300071, Peoples R China