(i) A graph G has 15 edges, 3 vertices of degree 4 and other vertices ofdegree 3. Find the number of vertices in G.
Question
(i) A graph G has 15 edges, 3 vertices of degree 4 and other vertices ofdegree 3. Find the number of vertices in G.
Solution
To find the number of vertices in graph G, we can use the Handshaking Theorem. The Handshaking Theorem states that the sum of the degrees of all vertices in a graph is equal to twice the number of edges.
Given that the graph has 15 edges, the sum of the degrees of all vertices is 2*15 = 30.
We know that there are 3 vertices of degree 4, so the sum of their degrees is 3*4 = 12.
Subtracting this from the total sum of degrees, we get 30 - 12 = 18. This is the sum of the degrees of the remaining vertices, each of which has degree 3.
Therefore, the number of remaining vertices is 18 / 3 = 6.
Adding the 3 vertices of degree 4, we find that graph G has a total of 3 + 6 = 9 vertices.
Similar Questions
A graph G has 21 edges, 3 vertices of degree 4 and other vertices are of degree 3. Findthe number of vertices in G.
A graph G has 4 vertices, of respective degrees 5,5,6,2. How many edges does G have?91836no such graph exists
A planar drawing of a connected graph G𝐺 has four faces, whose degrees are 3, 4, 5 and 8 respectively.How many edges does the graph have? Answer 1 Question 2How many vertices does the graph have?
A graph has 6 vertices, and each vertex has a degree of 2 except for one vertex, which has a degree of 4. Determine the number of edges in the graph.a.4b.7c.12d.16
If a graph has 8 vertices and 12 edges, then the degree of each vertex in the graph is:a.3b.6c.12d.10
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.