A non - trivial graph g is called irregular, if no two vertices of g have the same degrees. Prove that no graph is irregular.
Proof. Consider a graph G=(V,E) of order |V|=n, where n is a positive integer. By contradiction. Suppose that there is ...
Trivial, irregular graphs are investigated.