Here's the question you clicked on:
Integral
Sigh let's try this again: Let G be a connected regular graph with n edges. How many vertices can G have?
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?
actual the graph is regular so it n
the min would be a fully connected graph
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
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.
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
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