Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Let G be a connected planner graph with 35 re...
Start Learning for Free
Let G be a connected planner graph with 35 regions and the degree of each region is 6. Find the number of vertices in the graph.
Correct answer is '72'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Most Upvoted Answer
Let G be a connected planner graph with 35 regions and the degree of e...
Solution:
Given, a connected planar graph with 35 regions and the degree of each region is 6.
Let the number of vertices in the graph be V.
Let the number of edges in the graph be E.
Let the number of faces in the graph be F.
The degree of a vertex is the number of edges that are connected to it. Since each region has a degree of 6, we can say that there are 6 edges that are connected to each vertex.
We know that the sum of the degrees of all vertices in a graph is equal to twice the number of edges.
Therefore, 6V = 2E
We also know that in a planar graph, the number of faces F can be calculated using Euler's formula:
F = E - V + 2
Since the graph has 35 regions, we can say that F = 35.
Substituting the values of F and 6V = 2E in the above formula, we get:
35 = E - V + 2
or, E = V + 33
Substituting this value of E in the equation 6V = 2E, we get:
6V = 2(V + 33)
or, 4V = 66
or, V = 16.5
Since the number of vertices is a whole number, we can round up to the nearest integer, which is 17.
Therefore, the number of vertices in the graph is 17.
But the given answer is '72'. So, there seems to be some mistake in the question or the answer.
Conclusion:
The answer given in the question seems to be incorrect. The actual number of vertices in the graph cannot be determined using the given information.
Given, a connected planar graph with 35 regions and the degree of each region is 6.
Let the number of vertices in the graph be V.
Let the number of edges in the graph be E.
Let the number of faces in the graph be F.
The degree of a vertex is the number of edges that are connected to it. Since each region has a degree of 6, we can say that there are 6 edges that are connected to each vertex.
We know that the sum of the degrees of all vertices in a graph is equal to twice the number of edges.
Therefore, 6V = 2E
We also know that in a planar graph, the number of faces F can be calculated using Euler's formula:
F = E - V + 2
Since the graph has 35 regions, we can say that F = 35.
Substituting the values of F and 6V = 2E in the above formula, we get:
35 = E - V + 2
or, E = V + 33
Substituting this value of E in the equation 6V = 2E, we get:
6V = 2(V + 33)
or, 4V = 66
or, V = 16.5
Since the number of vertices is a whole number, we can round up to the nearest integer, which is 17.
Therefore, the number of vertices in the graph is 17.
But the given answer is '72'. So, there seems to be some mistake in the question or the answer.
Conclusion:
The answer given in the question seems to be incorrect. The actual number of vertices in the graph cannot be determined using the given information.
Free Test
FREE
| Start Free Test |
Community Answer
Let G be a connected planner graph with 35 regions and the degree of e...
By simple planner graph theorem, if the degree of each region is 'K',
K|R| = 2|E| (where R = region and E = edge)
K|R| = 2|E|
6 * 35 = 2|E|
|E| = 105
|V| + |R| = |E| + 2
V = 105 - 35 + 2
V = 72
K|R| = 2|E| (where R = region and E = edge)
K|R| = 2|E|
6 * 35 = 2|E|
|E| = 105
|V| + |R| = |E| + 2
V = 105 - 35 + 2
V = 72
Attention Computer Science Engineering (CSE) Students!
To make sure you are not studying endlessly, EduRev has designed Computer Science Engineering (CSE) study material, with Structured Courses, Videos, & Test Series. Plus get personalized analysis, doubt solving and improvement plans to achieve a great score in Computer Science Engineering (CSE).
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Similar Computer Science Engineering (CSE) Doubts
Top Courses for Computer Science Engineering (CSE)View all
Let G be a connected planner graph with 35 regions and the degree of each region is 6. Find the number of vertices in the graph.Correct answer is '72'. Can you explain this answer?
Question Description
Let G be a connected planner graph with 35 regions and the degree of each region is 6. Find the number of vertices in the graph.Correct answer is '72'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Let G be a connected planner graph with 35 regions and the degree of each region is 6. Find the number of vertices in the graph.Correct answer is '72'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Let G be a connected planner graph with 35 regions and the degree of each region is 6. Find the number of vertices in the graph.Correct answer is '72'. Can you explain this answer?.
Let G be a connected planner graph with 35 regions and the degree of each region is 6. Find the number of vertices in the graph.Correct answer is '72'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Let G be a connected planner graph with 35 regions and the degree of each region is 6. Find the number of vertices in the graph.Correct answer is '72'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Let G be a connected planner graph with 35 regions and the degree of each region is 6. Find the number of vertices in the graph.Correct answer is '72'. Can you explain this answer?.
Solutions for Let G be a connected planner graph with 35 regions and the degree of each region is 6. Find the number of vertices in the graph.Correct answer is '72'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE).
Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of Let G be a connected planner graph with 35 regions and the degree of each region is 6. Find the number of vertices in the graph.Correct answer is '72'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
Let G be a connected planner graph with 35 regions and the degree of each region is 6. Find the number of vertices in the graph.Correct answer is '72'. Can you explain this answer?, a detailed solution for Let G be a connected planner graph with 35 regions and the degree of each region is 6. Find the number of vertices in the graph.Correct answer is '72'. Can you explain this answer? has been provided alongside types of Let G be a connected planner graph with 35 regions and the degree of each region is 6. Find the number of vertices in the graph.Correct answer is '72'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice Let G be a connected planner graph with 35 regions and the degree of each region is 6. Find the number of vertices in the graph.Correct answer is '72'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
|
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Suggested Free Tests
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup