menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Feedback to GATE Overflow Test Takers
GATE 2021 – Online registration portal
IIT Madras MS CS Interview Experience - 2020
JEST TCS (Theoretical Computer Science) EXAM || Gateway of IISc other than GATE exam
Divisibility language and Minimum Number of States in a DFA accepting a binary number divisible by 'n'
Subjects
All categories
General Aptitude
(2k)
Engineering Mathematics
(8.4k)
Discrete Mathematics
(5.9k)
Mathematical Logic
(2.1k)
Set Theory & Algebra
(1.5k)
Combinatory
(1.4k)
Graph Theory
(881)
Probability
(1.1k)
Linear Algebra
(736)
Calculus
(606)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.5k)
Computer Networks
(4.2k)
Non GATE
(1.2k)
Others
(1.4k)
Admissions
(595)
Exam Queries
(1k)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(873)
Recent Blog Comments
Yes, it must be censored or else someone will...
oh got it !!! yes his test series is worst.
I mentioned RBR but this particular name is...
@Musa why are u not mentioning *** test series...
I took made easy,RBR ,Gate overflow test...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Graph Theory Doubt
0
votes
220
views
Let G be a planar graph with 7 vertices, 10 edges and 3 components then the number of regions are :
a)24
b)37
c)7
d)10
Answer given : 7
How to solve this ? Is there any formulae for number of regions calculation?
The only one I know is r=e-n+2 for any planar graph.
graph-theory
discrete-mathematics
engineering-mathematics
graph-connectivity
asked
Dec 25, 2017
in
Graph Theory
Sourajit25
220
views
answer
comment
4
Euler's formula for planar graph:
V - E + R = 1 + K
where, K-> No. of components
Solve using this, R=7
0
Thanks
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Prev.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
Related questions
1
vote
2
answers
1
279
views
graph theory
Maximum no of edges in a triangle-free, simple planar graph with 10 vertices
Maximum no of edges in a triangle-free, simple planar graph with 10 vertices
asked
Dec 23, 2017
in
Graph Theory
Parshu gate
279
views
graph-theory
discrete-mathematics
graph-connectivity
graph-matching
engineering-mathematics
0
votes
0
answers
2
162
views
Graph Theory
algorithm to find more than one path between any two vertices of a graph G=(V,E) , with a complexity of O(VE) ?
algorithm to find more than one path between any two vertices of a graph G=(V,E) , with a complexity of O(VE) ?
asked
May 12, 2017
in
Graph Theory
Pavan Kumar Munnam
162
views
graph-theory
discrete-mathematics
graph-connectivity
engineering-mathematics
3
votes
3
answers
3
513
views
graph theory
A graph consists of only one vertex,which is isolated ..Is that graph A) a complete graph ??? B) a clique??? C) connected graph ??? Please explain your answer ...
A graph consists of only one vertex,which is isolated ..Is that graph A) a complete graph ??? B) a clique??? C) connected graph ??? Please explain your answer ...
asked
Apr 7, 2017
in
Graph Theory
Vicky rix
513
views
graph-theory
discrete-mathematics
graph-connectivity
engineering-mathematics
0
votes
1
answer
4
274
views
graph theory
asked
Mar 12, 2017
in
Graph Theory
Vicky rix
274
views
graph-theory
discrete-mathematics
graph-connectivity
engineering-mathematics
...