MHB Degrees of Vertices II: 8 Edges in G

  • 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 1, 2, 3, 4, 6, respectively, how many edges are in G?

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

2E = 1 + 2 + 3 + 4 + 6

2E = 16

E = 8

The amount of edges in G is 8.

Is this correct?
 
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 1, 2, 3, 4, 6, respectively, how many edges are in G?
2E = deg v1 + deg v2 + deg v3 + deg v4 + deg v5
2E = 1 + 2 + 3 + 4 + 6
2E = 16
E = 8
The amount of edges in G is 8. Is this correct?

Yes that is correct. Two times the number of edges equals the sum of the degrees of the vertices.
 
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.
Back
Top