At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga.
Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus.
Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get our expert's

answer on brainly

SEE EXPERT ANSWER

Get your **free** account and access **expert** answers to this and **thousands** of other questions.

See more answers at brainly.com

Get this expert

answer on brainly

SEE EXPERT ANSWER

Get your **free** account and access **expert** answers to this and **thousands** of other questions

the most vertices it can have is n-1

Can you post your reasoning please?

sorry n+1

actual the graph is regular so it n

the min would be a fully connected graph

|dw:1332551750259:dw|

|dw:1332551852360:dw|

Doesn't regular mean no loops or repeated edges?

Ohhh

So a regular connected graph would have to be a cycle if the number of vertices is greater than 2?

a simple graph whose vertices all have the same degree r.

Yes you're right.

5 vertices fully connected is 10
6 vertices ..... 15
..
so

wait you lost me

sorry about the confusion in technical terms it's been a while