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
Lists
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
902
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.6k
points)
retagged
Dec 3, 2015
by
Akash Kanase

902
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
(
34k
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.6k
points)

528
views
gate1992
graphtheory
normal
graphplanarity
outofsyllabusnow
+15
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
(
40.3k
points)

3.8k
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
(
103k
points)

1.1k
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
List of Available Exams
New Assignment on Network programming : P2P simulation
Theory of Computation  GO Classroom
Probability  GO Classroom
Daily Quiz
All categories
General Aptitude
1.4k
Engineering Mathematics
6k
Discrete Mathematics
4.1k
Mathematical Logic
1.7k
Set Theory & Algebra
1k
Combinatory
736
Graph Theory
679
Probability
844
Linear Algebra
570
Calculus
413
Digital Logic
2.3k
Programming & DS
4.3k
Algorithms
3.7k
Theory of Computation
4.7k
Compiler Design
1.7k
Operating System
3.4k
Databases
3.4k
CO & Architecture
2.9k
Computer Networks
3.4k
Non GATE
1.2k
Others
1.3k
Admissions
506
Exam Queries
482
Tier 1 Placement Questions
22
Job Queries
64
Projects
17
Follow @csegate
Gatecse
Recent Blog Comments
plz anyone provide pgt nontech question paper...
what is non tech sllybus of kvs pgt computer...
Nice 2 know. You are welcome. :)
Hello @Arjun, I got books now...thanks for your...
41,147
questions
47,708
answers
147,680
comments
62,407
users