A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 4 years ago
Sigh let's try this again:
Let G be a connected regular graph with n edges. How many vertices can G have?
anonymous
 4 years ago
Sigh let's try this again: Let G be a connected regular graph with n edges. How many vertices can G have?

This Question is Closed

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0A 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.

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0the most vertices it can have is n1

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0Can you post your reasoning please?

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0actual the graph is regular so it n

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0the min would be a fully connected graph

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0dw:1332551750259:dw

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0dw:1332551852360:dw

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0Doesn't regular mean no loops or repeated edges?

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0see i dont think that graph is regular a regular means each vertex has the same number of edges as every other vertex

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0So a regular connected graph would have to be a cycle if the number of vertices is greater than 2?

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0a simple graph whose vertices all have the same degree r.

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0for 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)(t1)/2

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.05 vertices fully connected is 10 6 vertices ..... 15 .. so

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0there 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

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0for 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

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0sorry about the confusion in technical terms it's been a while

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0so 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
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.