Q16-b
NATMarks unknownShow that all vertices in an undirected finite graph cannot have distinct degrees, if the graph has at least two vertices.
Sign in to save attempts.
Loading…
Show that all vertices in an undirected finite graph cannot have distinct degrees, if the graph has at least two vertices.
Loading…