If the graph has no edges, but at least 2 vertices, then 0 is repeated in the
degree sequence. If the graph has at least one edge, but at most one isolated
vertex, discard the isolated vertex and consider the remaining graph.
The degree sequence has one entry for each of the N vertices. The minimum
degree is 1, while the maximum degree is N − 1. Since there are at
most N −1 distinct degrees, but there are N entries, at least one must appear
twice
If the graph has no edges, but at least 2 vertices, then 0 is repeated in thedegree sequence. If the graph has at least one edge, but at most one isolatedvertex, discard the isolated vertex and consider the remaining graph.The degree sequence has one entry for each of the N vertices. The minimumdegree is 1, while the maximum degree is N − 1. Since there are atmost N −1 distinct degrees, but there are N entries, at least one must appeartwice
การแปล กรุณารอสักครู่..