THE INDEX OF A SPECIAL BIPARTITE GRAPH

Jing Chu; Feng Xu; Xiaona Zhou

THE INDEX OF A SPECIAL BIPARTITE GRAPH

Authors

Jing Chu Anhui University of Science and Technology - Department of Mathematics and Physics
Feng Xu Anhui University of Science and Technology - Department of Mathematics and Physics
Xiaona Zhou Anhui University of Science and Technology - Department of Mathematics and Physics

Abstract

The Harary index of a graph is de¯ned 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 the class of all connected n-vertex bipartite graphs with a given matching number q. We characterize the unique graph with the maximum Harary index in the class of all connected n-vertex bipartite graphs with a given matching number q.

Cover of n°35 Italian Journal of Pure and Applied Mathematics

Downloads

Published

2015-12-31

How to Cite

Chu, J., Xu, F., & Zhou, X. (2015). THE INDEX OF A SPECIAL BIPARTITE GRAPH. Italian Journal of Pure and Applied Mathematics, 35, 569–574. Retrieved from https://journals.uniurb.it/index.php/ijpam/article/view/6395