Sigh let's try this again: Let G be a connected regular graph with n edges. How many vertices can G have?

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.

A community for students.

Sigh let's try this again: Let G be a connected regular graph with n edges. How many vertices can G have?

Mathematics
See more answers at brainly.com
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 this expert

answer on brainly

SEE EXPERT ANSWER

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

A graph which is connected in the sense of a topological space, i.e., there is a path from any point to any other point in the graph.
the most vertices it can have is n-1
Can you post your reasoning please?

Not the answer you are looking for?

Search for more explanations.

Ask your own question

Other answers:

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?
see i dont think that graph is regular a regular means each vertex has the same number of edges as every other vertex
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.
for a fully connected is regular as each vertix has the max number of edges so for a given number of vertices ie t the number of edges (t)(t-1)/2
5 vertices fully connected is 10 6 vertices ..... 15 .. so
wait you lost me
there is a min and the max .. .we got the max ... the min is a fully connected graph so if we were give 10 edges |dw:1332552333694:dw| we know it has 5 vertice but what would happen if we had 14 edges
for n edges the degree count is n*2 so the max is n*2/2 and the min is the number which leaves no remainder n*2/deg(x) x regular grpah
sorry about the confusion in technical terms it's been a while
so if we had 15 edges the toatal degrees would be 30 the max number of vertices is 15 with each degree 2 the min would be 6vertices with each degree 5

Not the answer you are looking for?

Search for more explanations.

Ask your own question