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
JEST 2021 registrations are open
TIFR GS-2021 Online Application portal
IIT Jodhpur Mtech AI - Interview Expierence (Summer Admission)
Interview experience at IIT Tirupati for MS program winter admission
IITH CSE interview M Tech RA Winter admission 2021
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.4k)
Discrete Mathematics
(6k)
Mathematical Logic
(2.1k)
Set Theory & Algebra
(1.6k)
Combinatory
(1.4k)
Graph Theory
(885)
Probability
(1.1k)
Linear Algebra
(779)
Calculus
(644)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
Others
(1.3k)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Recent Blog Comments
Hi, could you please update us about the Mock...
Hi, just curious if there are any updates...
thanks himanshu2021. But I am asking for the page...
But IISc hasn't mentioned TCS as one of their...
@kiioo https://gateoverflow.in/blog/11426/jest-20...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
minimum number of vertices of planner graph of edges e
2
votes
158
views
asked
Jan 22, 2016
in
Graph Theory
monali
158
views
answer
comment
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
2
votes
From Kurtowski's test
e<
=
3*n-6 (if graph is connected planar simple graph)
=> n>=(e
+6)/3
answered
Jan 22, 2016
Abhishekcs10
comment
Please
log in
or
register
to add a comment.
← Prev.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
Related questions
1
vote
1
answer
1
192
views
Prove that maximam number of edges in a planer graph with n vertices is 3n-6
asked
Dec 16, 2014
in
Graph Theory
Sahil Gupta
192
views
2
votes
1
answer
2
2.6k
views
How many vertices and how many edges do these graphs have? a) Kn b) Cn c) Wn d) Km,n e) Qn
asked
Jun 14, 2016
in
Graph Theory
Pinku Kumar Jha
2.6k
views
0
votes
1
answer
3
849
views
no of simple graph possible with 6 vertices and 4 edges is ?
asked
Dec 31, 2017
in
Graph Theory
adarsh shivhare
849
views
0
votes
1
answer
4
580
views
if the simple graph G has 5 vertices and 7 edges, how many edges does G have ?
asked
Dec 31, 2017
in
Graph Theory
adarsh shivhare
580
views
...