Got Homework?
Connect with other students for help. It's a free community.
Here's the question you clicked on:
 0 viewing
Integral
Group Title
Sigh let's try this again:
Let G be a connected regular graph with n edges. How many vertices can G have?
 2 years ago
 2 years ago
Integral Group Title
Sigh let's try this again: Let G be a connected regular graph with n edges. How many vertices can G have?
 2 years ago
 2 years ago

This Question is Closed

Integral Group TitleBest ResponseYou've already chosen the best response.0
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.
 2 years ago

benice Group TitleBest ResponseYou've already chosen the best response.2
the most vertices it can have is n1
 2 years ago

Integral Group TitleBest ResponseYou've already chosen the best response.0
Can you post your reasoning please?
 2 years ago

benice Group TitleBest ResponseYou've already chosen the best response.2
actual the graph is regular so it n
 2 years ago

benice Group TitleBest ResponseYou've already chosen the best response.2
the min would be a fully connected graph
 2 years ago

benice Group TitleBest ResponseYou've already chosen the best response.2
dw:1332551750259:dw
 2 years ago

Integral Group TitleBest ResponseYou've already chosen the best response.0
dw:1332551852360:dw
 2 years ago

Integral Group TitleBest ResponseYou've already chosen the best response.0
Doesn't regular mean no loops or repeated edges?
 2 years ago

benice Group TitleBest ResponseYou've already chosen the best response.2
see i dont think that graph is regular a regular means each vertex has the same number of edges as every other vertex
 2 years ago

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

Integral Group TitleBest ResponseYou've already chosen the best response.0
a simple graph whose vertices all have the same degree r.
 2 years ago

Integral Group TitleBest ResponseYou've already chosen the best response.0
Yes you're right.
 2 years ago

benice Group TitleBest ResponseYou've already chosen the best response.2
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)(t1)/2
 2 years ago

benice Group TitleBest ResponseYou've already chosen the best response.2
5 vertices fully connected is 10 6 vertices ..... 15 .. so
 2 years ago

Integral Group TitleBest ResponseYou've already chosen the best response.0
wait you lost me
 2 years ago

benice Group TitleBest ResponseYou've already chosen the best response.2
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
 2 years ago

benice Group TitleBest ResponseYou've already chosen the best response.2
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
 2 years ago

benice Group TitleBest ResponseYou've already chosen the best response.2
sorry about the confusion in technical terms it's been a while
 2 years ago

benice Group TitleBest ResponseYou've already chosen the best response.2
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
 2 years ago
See more questions >>>
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.