MHB Graph Theory Proof: Connectivity of G Proven

annie122
Messages
51
Reaction score
0
[SOLVED]Graph theory proof

The graph G has precisely two vertices x and y of odd degree. A new graph of multigraph H is formed from G by adding an edge xy. If H is connected, prove that G is connected.

Please check my following proof for this problem.

Since G has exactly two odd vertices, there is an Euler walk between x and y.
Denote this walk by xEy, where E is a string of vertices.

A walk between two vertices in H either (1)contains edge xy or (2)does not contain edge xy.

(1)Let a, b be two vertices connected via edge xy, so aAxyBb, A and B being strings of vertices.
But then there is a walk from a to b in G, by way of aAxEyBb.

(2)If a walk between two vertices that does not contain edge xy exists in H, it also exists in G.

Hence, any two vertices connected in H are connected in G. Therefore, if H is connected, G is connected.
 
Last edited:
Physics news on Phys.org
Yuuki said:
The graph G has precisely two vertices x and y of odd degree. A new graph of multigraph H is formed from G by adding an edge xy. If H is connected, prove that G is connected.
Please check my following proof for this problem.
Since G has exactly two odd vertices, there is an Euler walk between x and y.
Denote this walk by xEy, where E is a string of vertices.
A walk between two vertices in H either (1)contains edge xy or (2)does not contain edge xy.
(1)Let a, b be two vertices connected via edge xy, so aAxyBb, A and B being strings of vertices.
But then there is a walk from a to b in G, by way of aAxEyBb.
(2)If a walk between two vertices that does not contain edge xy exists in H, it also exists in G.
Hence, any two vertices connected in H are connected in G. Therefore, if H is connected, G is connected.

Frankly I have no idea how that argument works.

Where have you used "G has precisely two vertices x and y of odd degree"?

If $$G$$ is not connected then it is the union of at least two components.
Because each component is a sub-graph and any graph has an even number of odd verticies, then $$x\&~y$$ belong to the same component.

So how would adding another edge $$xy$$ to $$G$$ connect it?
 
Yuuki said:
The graph G has precisely two vertices x and y of odd degree. A new graph of multigraph H is formed from G by adding an edge xy. If H is connected, prove that G is connected.

Please check my following proof for this problem.

Since G has exactly two odd vertices, there is an Euler walk between x and y.
Denote this walk by xEy, where E is a string of vertices.

A walk between two vertices in H either (1)contains edge xy or (2)does not contain edge xy.

(1)Let a, b be two vertices connected via edge xy, so aAxyBb, A and B being strings of vertices.
But then there is a walk from a to b in G, by way of aAxEyBb.

(2)If a walk between two vertices that does not contain edge xy exists in H, it also exists in G.

Hence, any two vertices connected in H are connected in G. Therefore, if H is connected, G is connected.

I used it here.
But I now realize this is a big mistake, because the argument

a graph has two odd vertices \Rightarrow the graph has an Euler walk

is valid only for connected graphs.
I can't use this assumption because that is precisely what I'm trying to prove.

As for the other argument, I tried to separate it into binary cases.
To use the (wrong) Euler circuit argument.So,

G is not connected.
\Rightarrow There are at least two components.
\Rightarrow Since each component is connected, there must be an even number of odd vertices.
\Rightarrow x and y must belong to the same component because there are only two odd vertices in G.
\Rightarrow Connecting x and y will not connect disjoint components.

Hence, if G is not connected, neither is H, which proves the assumption by contraposition?
 
Yuuki said:
G is not connected.
\Rightarrow There are at least two components.
\Rightarrow Since each component is connected, there must be an even number of odd vertices.
\Rightarrow x and y must belong to the same component because there are only two odd vertices in G.
\Rightarrow Connecting x and y will not connect disjoint components.
Hence, if G is not connected, neither is H, which proves the assumption by contraposition?

That is now correct.
 
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
4
Views
2K
Replies
1
Views
2K
Replies
1
Views
2K
Replies
1
Views
1K
Replies
2
Views
3K
Replies
2
Views
2K
Back
Top