A community for students.
Here's the question you clicked on:
 0 viewing
Bee_see
 one year ago
I was wondering if someone could check my answers for these problems:
1) Construct a simple graph G with all of the following properties:
• G is connected.
• G contains an edge whose removal disconnects G.
• Every vertex of G has degree equal to 5.
Bee_see
 one year ago
I was wondering if someone could check my answers for these problems: 1) Construct a simple graph G with all of the following properties: • G is connected. • G contains an edge whose removal disconnects G. • Every vertex of G has degree equal to 5.

This Question is Closed

jim_thompson5910
 one year ago
Best ResponseYou've already chosen the best response.1I count 6 edges connected to these vertices (circled) dw:1442027885574:dw

Bee_see
 one year ago
Best ResponseYou've already chosen the best response.1Oh, ok. So I just erase one line ?

jim_thompson5910
 one year ago
Best ResponseYou've already chosen the best response.1but then the outer vertices would only have 4 edges

Bee_see
 one year ago
Best ResponseYou've already chosen the best response.1Oh, that's right. Do I use the 2nd graph I have instead?

jim_thompson5910
 one year ago
Best ResponseYou've already chosen the best response.1that won't work either because of the same reason as above that bridge edge makes 2 nodes have 6 connecting edges

jim_thompson5910
 one year ago
Best ResponseYou've already chosen the best response.1this seems to work though dw:1442028587295:dw

jim_thompson5910
 one year ago
Best ResponseYou've already chosen the best response.1dw:1442028753021:dw the number in each circle represents the degree of each node

Bee_see
 one year ago
Best ResponseYou've already chosen the best response.1where is the curved not allowed to be plugged in?

jim_thompson5910
 one year ago
Best ResponseYou've already chosen the best response.1what do you mean?

Bee_see
 one year ago
Best ResponseYou've already chosen the best response.1I was trying to do this problem: Construct a simple graph on 6 vertices with 12 edges that does not contain K4 as a subgraph. and I did a graph like...dw:1442028768219:dw

Bee_see
 one year ago
Best ResponseYou've already chosen the best response.1I was told this was impossible to do.

jim_thompson5910
 one year ago
Best ResponseYou've already chosen the best response.1so I'm reading that K4 is a complete graph with 4 vertices shown on page 3 of this pdf http://www.dehn.wustl.edu/~blake/circles/talks/2009jan18Russ_WoodroofeGraph_Theory.pdf is that the notation your teacher is using?

Bee_see
 one year ago
Best ResponseYou've already chosen the best response.1Oh, I did the problem. I was just asking about the curves. Is there a rule in which they can't be used for the graphs?

jim_thompson5910
 one year ago
Best ResponseYou've already chosen the best response.1I'm still not sure what you mean? In my drawing? or the one you posted?

Bee_see
 one year ago
Best ResponseYou've already chosen the best response.1Maybe I heard wrong...

jim_thompson5910
 one year ago
Best ResponseYou've already chosen the best response.1the edges can be curved, yes http://www.math.uvic.ca/faculty/gmacgill/guide/M222Graphs.pdf quoting that PDF ` Graphs are usually represented pictorially with a point (or dot) in the plane corresponding to each vertex and a line segment (or curve of some sort) joining the corresponding points for each pair of adjacent vertices.`

Bee_see
 one year ago
Best ResponseYou've already chosen the best response.1Hmm, can you check another problem for me?

Bee_see
 one year ago
Best ResponseYou've already chosen the best response.12) Find a cycle of length 20 in the following graph:

Bee_see
 one year ago
Best ResponseYou've already chosen the best response.1Since it's a cycle, I'm sure it's supposed to return to its starting point, no?

jim_thompson5910
 one year ago
Best ResponseYou've already chosen the best response.1yeah you have to make a circuit and not repeat vertices

jim_thompson5910
 one year ago
Best ResponseYou've already chosen the best response.1so they want you to find a circuit with 20 edges where you don't repeat vertices

jim_thompson5910
 one year ago
Best ResponseYou've already chosen the best response.1your answer looks great

Bee_see
 one year ago
Best ResponseYou've already chosen the best response.1Thank you for checking my answers.
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.