Ask your own question, for FREE!
Mathematics 8 Online
OpenStudy (anonymous):

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

OpenStudy (anonymous):

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.

OpenStudy (anonymous):

the most vertices it can have is n-1

OpenStudy (anonymous):

Can you post your reasoning please?

OpenStudy (anonymous):

sorry n+1

OpenStudy (anonymous):

actual the graph is regular so it n

OpenStudy (anonymous):

the min would be a fully connected graph

OpenStudy (anonymous):

|dw:1332551750259:dw|

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!