Consider a simple graph with 505 vertices. Each vertex is joined to exactly \(N\) others. How many different possible (non-negative, integer) values of \(N\) can there be?

**Details and assumptions**

A **simple graph** does not have multiple edges between vertices or self loops.

×

Problem Loading...

Note Loading...

Set Loading...