点连通度和图的边点数关系 Theorem 5.13 If G is a graph of order n and size m >=n-1,then 2m (G≤ 问题10：如何理解下文中的oound? The bound given in Theorem 5.13 is sharp in the sense that for every two integers n and m of a graph.点连通度和图的边点数关系 Theorem 5.13 If G is a graph of order n and size m >=n - 1, then The bound given in Theorem 5.13 is sharp in the sense that for every two integers n and m of a graph. 问题10：如何理解下文中的bound ?