有限简单连通图的棱凝聚度上界的估计

Discussion about The Minimum Upper Bound of The Edge Cohesiveness of Graph

本文证明了有限简单连通图的棱凝聚度的最小值上界之一为ｍｉｎ｛λ（Ｇ）－Ｋ（Ｇ）＋１，［λ（Ｇ）／２］｝。

This paper proves that one of the upper bounds of the edge cohesiveness minimum for simple connected graphs is min {λ(G)-K(G)+ 1,[λ(G)/2]},and the further estimate of the minimum upper bound is presented