机构:
Chizhou Univ, Dept Math, Chizhou 247000, Peoples R China
Anhui Univ, Sch Math Sci, Hefei 230601, Peoples R ChinaChizhou Univ, Dept Math, Chizhou 247000, Peoples R China
Li, Xiao-Xin
[1
,2
]
Fan, Yi-Zheng
论文数: 0引用数: 0
h-index: 0
机构:
Anhui Univ, Sch Math Sci, Hefei 230601, Peoples R ChinaChizhou Univ, Dept Math, Chizhou 247000, Peoples R China
Fan, Yi-Zheng
[2
]
机构:
[1] Chizhou Univ, Dept Math, Chizhou 247000, Peoples R China
[2] Anhui Univ, Sch Math Sci, Hefei 230601, Peoples R China
The Harary index of a graph is defined as the sum of reciprocals of distances between all pairs of vertices of the graph. In this paper we provide an upper bound of the Harary index in terms of the vertex or edge connectivity of a graph. We characterize the unique graph with the maximum Harary index among all graphs with a given number of cut vertices or vertex connectivity or edge connectivity. In addition we also characterize the extremal graphs with the second maximum Harary index among all graphs with given vertex connectivity. (C) 2014 Elsevier B.V. All rights reserved.
机构:
Cent S Univ, Sch Math & Stat, Changsha 410083, Hunan, Peoples R ChinaCent S Univ, Sch Math & Stat, Changsha 410083, Hunan, Peoples R China
Feng, Lihua
Zhu, Xiaomin
论文数: 0引用数: 0
h-index: 0
机构:
Cent S Univ, Sch Math & Stat, Changsha 410083, Hunan, Peoples R ChinaCent S Univ, Sch Math & Stat, Changsha 410083, Hunan, Peoples R China
Zhu, Xiaomin
Liu, Weijun
论文数: 0引用数: 0
h-index: 0
机构:
Cent S Univ, Sch Math & Stat, Changsha 410083, Hunan, Peoples R China
Nantong Univ, Sch Sci, Nantong 226019, Jiangsu, Peoples R ChinaCent S Univ, Sch Math & Stat, Changsha 410083, Hunan, Peoples R China
机构:
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
Cui, Zhihui
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