# Graph irregularity

Not what you're looking for? Search our solutions OR ask your own Custom question.

1.5 A nontrivial graph G is called irregular if no two vertices of G have the same degree. Prove that no graph is irregular.

Â© BrainMass Inc. brainmass.com October 3, 2022, 11:15 pm ad1c9bdddfhttps://brainmass.com/math/graphs-and-functions/graph-irregularity-98573

#### Solution Preview

1.5 A nontrivial graph G is called irregular if no two vertices of G have the same degree. Prove that no graph is ...

#### Solution Summary

This is a proof regarding graph irregularity.

$2.49