Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
GATE CSE 1992 | Question: 01,x
Kathleen
asked
in
Graph Theory
Sep 12, 2014
edited
Apr 19, 2021
by
Lakshman Bhaiya
5,466
views
10
votes
10
votes
Maximum number of edges in a planar graph with $n$ vertices is _____
gate1992
graph-theory
graph-planarity
easy
fill-in-the-blanks
Kathleen
asked
in
Graph Theory
Sep 12, 2014
edited
Apr 19, 2021
by
Lakshman Bhaiya
by
Kathleen
5.5k
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
13
votes
13
votes
Best answer
Answer: 3n - 6
Ref:
http://mathoverflow.net/questions/124116/maximum-number-of-edges-in-a-planar-graph
Rajarshi Sarkar
answered
Apr 25, 2015
selected
Apr 25, 2015
by
Arjun
by
Rajarshi Sarkar
comment
Follow
share this
4 Comments
by
suneetha
commented
Nov 14, 2018
reply
Follow
share this
i think it is 2n-2
if n=2 then edges will be 1 it is also a planar graph but according to your equation it becomes 0
0
0
by
Raghav Khajuria
commented
Nov 14, 2018
reply
Follow
share this
@ suneetha 2n-4 (not 2n-2) its true when the graph has no cycle of lenght 3.
0
0
by
suneetha
commented
Nov 14, 2018
reply
Follow
share this
they didn't represent about whether it should have cycle or not?
0
0
by
suneetha
commented
Nov 14, 2018
reply
Follow
share this
if n is even then the equation comes like 2(n-1)
if n is odd then the equation comes like 2n-1
then what is the answer for this question?
0
0
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
7
votes
7
votes
3
answers
1
Kathleen
asked
in
Compiler Design
Sep 12, 2014
1,549
views
GATE CSE 1992 | Question: 01,vii
Macro expansion is done in pass one instead of pass two in a two pass macro assembler because _________
Kathleen
asked
in
Compiler Design
Sep 12, 2014
by
Kathleen
1.5k
views
gate1992
compiler-design
macros
easy
fill-in-the-blanks
11
votes
11
votes
1
answer
2
Kathleen
asked
in
Computer Networks
Sep 12, 2014
3,134
views
GATE CSE 1992 | Question: 01,v
A simple and reliable data transfer can be accomplished by using the 'handshake protocol'. It accomplishes reliable data transfer because for every data item sent by the transmitter _______.
Kathleen
asked
in
Computer Networks
Sep 12, 2014
by
Kathleen
3.1k
views
gate1992
computer-networks
network-flow
easy
fill-in-the-blanks
37
votes
37
votes
10
answers
3
Kathleen
asked
in
Algorithms
Sep 12, 2014
17,435
views
GATE CSE 1992 | Question: 01,ix
Complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing $n$ vertices and $m$ edges if the edges are sorted is _______
Kathleen
asked
in
Algorithms
Sep 12, 2014
by
Kathleen
17.4k
views
gate1992
spanning-tree
algorithms
time-complexity
easy
fill-in-the-blanks
7
votes
7
votes
4
answers
4
Kathleen
asked
in
CO and Architecture
Sep 12, 2014
3,057
views
GATE CSE 1992 | Question: 01-iv
Many of the advanced microprocessors prefetch instructions and store it in an instruction buffer to speed up processing. This speed up is achieved because ________
Kathleen
asked
in
CO and Architecture
Sep 12, 2014
by
Kathleen
3.1k
views
gate1992
co-and-architecture
easy
instruction-execution
fill-in-the-blanks
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Discrete Mathematics
(7.1k)
Mathematical Logic
(2.5k)
Set Theory & Algebra
(1.9k)
Combinatory
(1.6k)
Graph Theory
(1.1k)
Probability
(1.4k)
Linear Algebra
(1.1k)
Calculus
(792)
Optimization
(0)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy