Explore BrainMass

Trivial, Irregular Graphs

A non - trivial graph g is called irregular, if no two vertices of g have the same degrees. Prove that no graph is irregular.

Solution Preview

Proof. Consider a graph G=(V,E) of order |V|=n, where n is a positive integer. By contradiction. Suppose that there is ...

Solution Summary

Trivial, irregular graphs are investigated.