MHB Degrees of Vertices II: 8 Edges in G

  • Thread starter Thread starter Joystar77
  • Start date Start date
  • Tags Tags
    Degrees
AI Thread Summary
In the graph G with vertex set V = {v1, v2, v3, v4, v5}, the degrees of the vertices are 1, 2, 3, 4, and 6. The formula used to calculate the number of edges is 2E = deg v1 + deg v2 + deg v3 + deg v4 + deg v5. By substituting the vertex degrees, the equation simplifies to 2E = 16, leading to E = 8. This confirms that the number of edges in G is indeed 8. The calculation is verified as correct.
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.
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top