Then the graph obtained by removing all adjacent edges of V must be disconnected, so λ(G)≤δ(G).

(2) Let a graph without λ(G) in G be disconnected, and the number of points in the graph must be less than the number of edges, so k(G)≤λ(G).