Average Distance and Independence Number
暂无分享,去创建一个
Abstract A sharp upper bound on the average distance of a graph depending on the order and the independence number is given. As a corollary we obtain the maximum average distance of a graph with given order and matching number. All extremal graphs are determined.
[1] Frank Harary,et al. Distance in graphs , 1990 .
[2] Fan Chung Graham,et al. The average distance and the independence number , 1988, Journal of Graph Theory.