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. For hardcopy of previous year questions please see
here
GATE199201,x
+5
votes
821
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.5k
points)
retagged
Dec 3, 2015
by
Akash Kanase

821
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.1k
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
GATE199202,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.5k
points)

487
views
gate1992
graphtheory
normal
graphplanarity
outofsyllabusnow
+14
votes
3
answers
2
GATE2015154
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
(
40k
points)

3.6k
views
gate20151
graphtheory
graphconnectivity
normal
graphplanarity
outofsyllabusnow
numericalanswers
+13
votes
1
answer
3
GATE201117
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.7k
points)

976
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
AAI Junior Exceutive(Information Technology)
The 2018 APL Problem Solving Contest
GO Classroom for GATE 2019
Mtech CSE  IITH (TA) Interview Experience
MS Programme @ IIT
All categories
General Aptitude
1.3k
Engineering Mathematics
5.4k
Discrete Mathematics
3.7k
Mathematical Logic
1.5k
Set Theory & Algebra
948
Combinatory
659
Graph Theory
617
Probability
659
Linear Algebra
531
Calculus
392
Digital Logic
2.1k
Programming & DS
3.8k
Algorithms
3.3k
Theory of Computation
4.1k
Compiler Design
1.6k
Operating System
2.9k
Databases
3k
CO & Architecture
2.6k
Computer Networks
3k
Non GATE
1.1k
Others
1.4k
Admissions
494
Exam Queries
442
Tier 1 Placement Questions
19
Job Queries
59
Projects
9
Follow @csegate
Gatecse
Recent Blog Comments
Thanks for the reply!
Hi, In last week no books have been sent as books ...
found this really helpful Channel on YouTube ...
Yes you can apply for more than one post just ...
Arjun sir Good Morning,
i didn't get ...
37,072
questions
44,643
answers
127,046
comments
43,699
users