The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
GATE1992_01,x
+5
votes
769
views
(x) Maximum number of edges in a planar graph with n vertices is _____
gate1992
graphtheory
graphplanarity
easy
outofsyllabusnow
asked
Sep 13, 2014
in
Graph Theory
by
Kathleen
Veteran
(
59.4k
points)
retagged
Dec 3, 2015
by
Akash Kanase

769
views
Facebook
Google+
Twitter
answer
comment
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
+8
votes
Best answer
Answer: 3n  6
Ref:
http://mathoverflow.net/questions/124116/maximumnumberofedgesinaplanargraph
answered
Apr 25, 2015
by
Rajarshi Sarkar
Boss
(
34.2k
points)
selected
Apr 25, 2015
by
Arjun
comment
Please
log in
or
register
to add a comment.
← Prev. Qn. in Sub.
Next Qn. in Sub. →
← Prev.
Next →
Related questions
+5
votes
3
answers
1
GATE1992_02,viii
Choose the correct alternatives ( more than one may be correct) and write the corresponding letters only: (viii) A nonplanar graph with minimum number of vertices has (a) 9 edges, 6 vertices (b) 6 edges, 4 vertices (c) 10 edges, 5 vertices (d) 9 edges, 5 vertices
asked
Sep 13, 2014
in
Graph Theory
by
Kathleen
Veteran
(
59.4k
points)

414
views
gate1992
graphtheory
normal
graphplanarity
outofsyllabusnow
+14
votes
3
answers
2
GATE20151_54
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is_______________.
asked
Feb 14, 2015
in
Graph Theory
by
makhdoom ghaya
Boss
(
39.7k
points)

3.4k
views
gate20151
graphtheory
graphconnectivity
normal
graphplanarity
outofsyllabusnow
numericalanswers
+13
votes
1
answer
3
GATE2011_17
K4 and Q3 are graphs with the following structures. Which one of the following statements is TRUE in relation to these graphs? (A) K4 is a planar while Q3 is not (B) Both K4 and Q3 are planar (C) Q3 is planar while K4 is not (D) Neither K4 nor Q3 is planar
asked
Sep 29, 2014
in
Graph Theory
by
jothee
Veteran
(
98.8k
points)

897
views
gate2011
graphtheory
graphplanarity
normal
outofsyllabusnow
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
barc result
Suggestion for IIITH exam
Placement Statistics for Computer Science
IIT Bombay Admission
ISRO 2018
All categories
General Aptitude
1.2k
Engineering Mathematics
4.9k
Discrete Mathematics
3.4k
Mathematical Logic
1.4k
Set Theory & Algebra
884
Combinatory
609
Graph Theory
576
Probability
621
Linear Algebra
506
Calculus
368
Digital Logic
2k
Programming & DS
3.6k
Algorithms
3k
Theory of Computation
3.9k
Compiler Design
1.5k
Operating System
2.8k
Databases
2.9k
CO & Architecture
2.5k
Computer Networks
2.9k
Non GATE
949
Others
1.3k
Admissions
408
Exam Queries
419
Tier 1 Placement Questions
17
Job Queries
55
Projects
9
Follow @csegate
Gatecse
Recent Blog Comments
got it :) thanks man
JUST VIST "important date" under barc login
where do they mention about the time?
NOW DAYS GATE ND ITS RELATED THINGS ARE DEMANDING ...
I'm not able to edit comment on blogs
34,780
questions
41,756
answers
118,923
comments
41,399
users