MHB Does the graph G with varying vertex degrees have an Eulerian path?

  • Thread starter Thread starter Joystar77
  • Start date Start date
  • Tags Tags
    Degrees
Joystar77
Messages
122
Reaction score
0
Let G be a graph with vertex set V = {v1, v2, v3, v4, v5}.

If the degrees of the vertices are 5, 1, 0, 6, 2, respectively, does G have an Eulerian path? Why or why not?

2E= deg v1 + deg v2 + deg v3 + deg v4 + deg v5

2E = 5 + 1 + 0 + 6 + 2

2E = 14

E = 7

Is it correct to say that G does have an Eulerian path because it can happen if the graph has either 0 or 2 vertices with odd degrees? Even an incomplete graph with the degree of 0 at one or more vertices can have an Eulerian path.

Is it correct to say that G doesn't have an Eulerian path because the path is suppose to pass through all edges exactly once?
 
Physics news on Phys.org
Joystar1977 said:
Let G be a graph with vertex set V = {v1, v2, v3, v4, v5}.

If the degrees of the vertices are 5, 1, 0, 6, 2, respectively, does G have an Eulerian path? Why or why not?

2E= deg v1 + deg v2 + deg v3 + deg v4 + deg v5

2E = 5 + 1 + 0 + 6 + 2

2E = 14

E = 7

Is it correct to say that G does have an Eulerian path because it can happen if the graph has either 0 or 2 vertices with odd degrees? Even an incomplete graph with the degree of 0 at one or more vertices can have an Eulerian path.
I don't understand your argument here. Can you restate this?

Joystar1977 said:
Is it correct to say that G doesn't have an Eulerian path because the path is suppose to pass through all edges exactly once?
This is not an argument which establishes the inexistence of an Eulerian path in the graph.

I think that there is no graph on five vertices which has 5, 1, 0, 6, 2 as the degrees of its vertices. So it doesn't make sense to ask if there is an Eulerian path in such a Graph.
 
This is a question for one of my problems on my assignment and states the following:

Let G be a graph with vertex set V = {v1, v2, v3, v4, v5}.

If the degrees of the vertices are 5, 1, 0, 6, 2, respectively, how many edges are in G?

I was told that an Eulerian path is a path which passes all edges exactly once. This can happen if the graph has either 0 or 2 vertices with odd degrees. Even an incomplete graph (with degree 0 at one or more vertices) can have an Eulerian path.

My question was that is it correct to say the following:

G does have an Eulerian path because it can take place even if the graph has 0 or many vertices to where you end up with an odd degree?

I don't want to confuse myself any more than what I already am with this problem.
Quote Originally Posted by Joystar1977 View Post
Is it correct to say that G doesn't have an Eulerian path because the path is suppose to pass through all edges exactly once?

caffeinemachine said:
I don't understand your argument here. Can you restate this?This is not an argument which establishes the inexistence of an Eulerian path in the graph.

I think that there is no graph on five vertices which has 5, 1, 0, 6, 2 as the degrees of its vertices. So it doesn't make sense to ask if there is an Eulerian path in such a Graph.
 
Joystar1977 said:
This is a question for one of my problems on my assignment and states the following:

Let G be a graph with vertex set V = {v1, v2, v3, v4, v5}.

If the degrees of the vertices are 5, 1, 0, 6, 2, respectively, how many edges are in G?

I was told that an Eulerian path is a path[/color] which passes all edges exactly once. This can happen if the graph has either 0 or 2 vertices with odd degrees. Even an incomplete graph (with degree 0 at one or more vertices) can have an Eulerian path.

My question was that is it correct to say the following:

G does have an Eulerian path because it can take place even if the graph has 0 or many vertices to where you end up with an odd degree?[/color]

I don't want to confuse myself any more than what I already am with this problem.
About the thing marked in red.. An Eulerian path is not a path! An Eulerian path is a trail, in general, which contains each edge exactly once.

Its true that if a connected Graph has zero or two odd vertices then it has an Eulerian Path. But here the problem is that there is no (simple) graph on $5$ vertices which has 5,1,0,6,2 as the degrees of its vertices. So the question in meaningless.

About the thing marked in blue. I don't understand what you are trying to say here. You may need to rephrase that.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Replies
1
Views
1K
Replies
2
Views
2K
Replies
1
Views
1K
Replies
13
Views
5K
Replies
2
Views
2K
Replies
1
Views
2K
Replies
22
Views
2K
Replies
3
Views
2K
Back
Top