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
Recent questions tagged graph-planarity
0
votes
1
answer
1
Self Doubt - Planarity of Complete Bipartite Graph
How to determine for which m, n the complete bipartite graph $Km,n$ is planar? I am getting two answers from two sources:- A complete bipartite graph $Kmn$ is planar if and only if m<3 or n>3. Source: https://www.javatpoint.com/ ... m ≤ 2 or n ≤ 2. Source: http://www.matthewkahle.org/download/file/fid/573 Need a proper proof of the solution.
Abhrajyoti00
asked
in
Graph Theory
Jul 21
by
Abhrajyoti00
137
views
graph-theory
bipartite-graph
discrete-mathematics
graph-planarity
2
votes
0
answers
2
TIFR CSE 2021 | Part A | Question: 15
Let $P$ be a convex polygon with sides $5, 4, 4, 3$. For example, the following: Consider the shape in the plane that consists of all points within distance $1$ from some point in $P$. If $\ell$ is the perimeter of the shape, which of the following ... the given information. $20\leq \ell < 21$ $21\leq \ell< 22$ $22\leq \ell< 23$ $23\leq \ell< 24$
soujanyareddy13
asked
in
Graph Theory
Mar 25, 2021
by
soujanyareddy13
256
views
tifr2021
graph-theory
graph-planarity
8
votes
5
answers
3
GATE CSE 2021 Set 1 | Question: 16
In an undirected connected planar graph $G$, there are eight vertices and five faces. The number of edges in $G$ is _________.
Arjun
asked
in
Graph Theory
Feb 18, 2021
by
Arjun
5.3k
views
gatecse-2021-set1
graph-theory
graph-planarity
numerical-answers
easy
1-mark
1
vote
1
answer
4
NIELIT 2017 DEC Scientific Assistant A - Section B: 38
If a planner graph, having $25$ vertices divides the plane into $17$ different regions. Then how many edges are used to connect the vertices in this graph. $20$ $30$ $40$ $50$
Lakshman Patel RJIT
asked
in
Graph Theory
Mar 31, 2020
by
Lakshman Patel RJIT
1.5k
views
nielit2017dec-assistanta
discrete-mathematics
graph-theory
graph-planarity
1
vote
1
answer
5
NIELIT 2016 DEC Scientist B (CS) - Section B: 5
Let $G$ be a simple undirected planar graph on $10$ vertices with $15$ edges. If $G$ is a connected graph, then the number of bounded faces in any embedding of $G$ on the plane is equal to: $3$ $4$ $5$ $6$
Lakshman Patel RJIT
asked
in
Graph Theory
Mar 31, 2020
by
Lakshman Patel RJIT
841
views
nielit2016dec-scientistb-cs
discrete-mathematics
graph-theory
graph-planarity
1
vote
1
answer
6
NIELIT 2017 July Scientist B (IT) - Section B: 8
A connected planar graph divides the plane into a number of regions. If the graph has eight vertices and these are linked by $13$ edges, then the number of regions is: $5$ $6$ $7$ $8$
Lakshman Patel RJIT
asked
in
Graph Theory
Mar 30, 2020
by
Lakshman Patel RJIT
2.3k
views
nielit2017july-scientistb-it
discrete-mathematics
graph-theory
graph-planarity
1
vote
1
answer
7
NIELIT 2017 July Scientist B (IT) - Section B: 12
Let $G$ be a simple connected planar graph with $13$ vertices and $19$ edges. Then, the number of faces in the planar embedding of the graph is $6$ $8$ $9$ $13$
Lakshman Patel RJIT
asked
in
Graph Theory
Mar 30, 2020
by
Lakshman Patel RJIT
477
views
nielit2017july-scientistb-it
discrete-mathematics
graph-theory
graph-planarity
0
votes
4
answers
8
NIELIT 2017 July Scientist B (CS) - Section B: 14
If $G$ is an undirected planar graph on $n$ vertices with $e$ edges then $e\leq n$ $e\leq 2n$ $e\leq 3n$ None of the option
Lakshman Patel RJIT
asked
in
Graph Theory
Mar 30, 2020
by
Lakshman Patel RJIT
6.9k
views
nielit2017july-scientistb-cs
discrete-mathematics
graph-theory
graph-planarity
0
votes
2
answers
9
NIELIT 2017 July Scientist B (CS) - Section B: 15
Choose the most appropriate definition of plane graph. A simple graph which is isomorphic to hamiltonian graph. A graph drawn in a plane in such a way that if the vertex set of graph can be partitioned into two non-empty disjoint subset $X$ and ... in a plane in such a way that any pair of edges meet only at their end vertices. None of the option.
Lakshman Patel RJIT
asked
in
Graph Theory
Mar 30, 2020
by
Lakshman Patel RJIT
2.2k
views
nielit2017july-scientistb-cs
discrete-mathematics
graph-theory
graph-planarity
7
votes
1
answer
10
UGC NET CSE | June 2019 | Part 2 | Question: 4
Suppose that a connected planar graph has six vertices, each of degree four. Into how many regions is the plane divided by a planar representation of this graph? $6$ $8$ $12$ $20$
Arjun
asked
in
Graph Theory
Jul 2, 2019
by
Arjun
6.5k
views
ugcnetcse-june2019-paper2
graph-planarity
handshaking-theorem
1
vote
0
answers
11
What to study & from where to study - Graph Theory for GATE 2019.
Are the following topics necessary/ apt to study for gate.(Bold items are explicitly mentioned in gate syllabus document) Connectivity Matching Coloring Cuts Covering Independent Sets Planar Graphs Isomorphism Walks, Trails, Paths, ... taking a lot of time. Can anyone please recommend a reliable and simple resource to go with.
Krishna Sai Vootla
asked
in
Graph Theory
Dec 29, 2018
by
Krishna Sai Vootla
1.4k
views
syllabus
engineering-mathematics
graph-theory
graph-planarity
graph-isomorphism
vertex-cover
1
vote
0
answers
12
Planar graph
In a connected 3 regular graph, every planar region is bounded by exactly 5 edges, then count no of edges?
Shamim Ahmed
asked
in
Graph Theory
Dec 21, 2018
by
Shamim Ahmed
551
views
graph-theory
graph-planarity
0
votes
1
answer
13
Planar Graph
Let G be a simple connected planar graph with 14 vertices and 20 edges. Number of closed regions in planar embedding of the graph is ?
Na462
asked
in
Graph Theory
Dec 2, 2018
by
Na462
3.0k
views
graph-theory
graph-planarity
0
votes
1
answer
14
Planar Graph
Can minimum degree of a planar graph be $5$? Give some example
srestha
asked
in
Graph Theory
Oct 23, 2018
by
srestha
1.1k
views
graph-theory
graph-planarity
2
votes
1
answer
15
planar region
How many planar regions? How many closed regions? and how many are unbounded? How many of then are bounded by a cycle of length $4$ ? Now, for example (a different question, not related to above diagram ) a question says, In a connected 3 regular graph, ... region is bounded by exactly 5 edges, then count no of edges? Please explain the last QS with the help of Euler's equation.
dd
asked
in
Graph Theory
Dec 26, 2016
by
dd
2.0k
views
graph-theory
graph-planarity
2
votes
1
answer
16
Planar graph || Kenneth
A planar graph has, $\large\color{maroon}{\text{k}}$ connected components $\large\color{maroon}{\text{v}}$ vertices $\large\color{maroon}{\text{e}}$ edges If the plane is divided into $\large\color{maroon}{\text{r}}$ ... $\large\color{maroon}{\text{v}}$ , $\large\color{maroon}{\text{e}}$ and $\large\color{maroon}{\text{r}}$ ?
dd
asked
in
Graph Theory
Dec 20, 2016
by
dd
498
views
graph-theory
graph-planarity
1
vote
1
answer
17
Check whether given graph is planar
G1 and G2 are two graphs as shown— (A) Both 01 and G2 are planar graphs (B) Both G1 and G2 are not planar graphs (C) GI is planar and G2 is not planar graph (D) G1 is not planar and G2 is planar graph
sh!va
asked
in
Graph Theory
Dec 4, 2016
by
sh!va
780
views
graph-theory
graph-planarity
30
votes
4
answers
18
GATE CSE 1989 | Question: 3-vi
Which of the following graphs is/are planner?
makhdoom ghaya
asked
in
Graph Theory
Nov 27, 2016
by
makhdoom ghaya
6.0k
views
gate1989
normal
graph-theory
graph-planarity
descriptive
24
votes
2
answers
19
GATE CSE 1990 | Question: 3-xi
A graph is planar if and only if, It does not contain a subgraph homeomorphic to $k_{5}$ and $k_{3, 3}$. It does not contain a subgraph isomorphic to $k_{5}$ and $k_{3, 3}$. It does not contain a subgraph isomorphic to $k_{5}$ or $k_{3, 3}$ It does not contain a subgraph homeomorphic to $k_{5}$ or $k_{3, 3}$.
makhdoom ghaya
asked
in
Graph Theory
Nov 23, 2016
by
makhdoom ghaya
9.4k
views
gate1990
normal
graph-theory
graph-planarity
multiple-selects
3
votes
1
answer
20
GATE CSE 1987 | Question: 2e
State whether the following statement is TRUE or FALSE: There is a linear-time algorithm for testing the planarity of finite graphs.
makhdoom ghaya
asked
in
Graph Theory
Nov 9, 2016
by
makhdoom ghaya
856
views
gate1987
graph-theory
graph-planarity
true-false
4
votes
2
answers
21
UGC NET CSE | December 2012 | Part 3 | Question: 46
Two graphs A and B are shown below: Which one of the following statements is true? Both A and B are planar Neither A nor B is planar A is planar and B is not B is planar and A is not
go_editor
asked
in
Graph Theory
Jul 13, 2016
by
go_editor
1.6k
views
ugcnetcse-dec2012-paper3
graph-theory
graph-planarity
4
votes
3
answers
22
UGC NET CSE | June 2012 | Part 3 | Question: 72
$G_1$ and $G_2$ are two graphs as shown: Both $G_1$ and $G_2$ are planar graphs Both $G_1$ and $G_2$ are not planar graphs $G_1$ is planar and $G_2$ is not planar $G_1$ is not planar and $G_2$ is planar
go_editor
asked
in
Graph Theory
Jul 8, 2016
by
go_editor
3.3k
views
ugcnetcse-june2012-paper3
graph-theory
graph-planarity
1
vote
1
answer
23
condition for planar graph??
what is the sufficient condition so that we say given graph is planar or not???
Hira Thakur
asked
in
Graph Theory
Nov 21, 2015
by
Hira Thakur
673
views
graph-planarity
25
votes
8
answers
24
GATE CSE 2015 Set 1 | Question: 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_______________.
makhdoom ghaya
asked
in
Graph Theory
Feb 14, 2015
by
makhdoom ghaya
19.6k
views
gatecse-2015-set1
graph-theory
graph-connectivity
normal
graph-planarity
numerical-answers
1
vote
2
answers
25
planar graphs
Is there any subgraph homoemorphic to K5 present in G1 for the following question? Which one of the following graphs is NOT planar? (A) G1 (B) G2 (C) G3 (D) G4 In this question planar drawings( no 2 edges intersect) for G2, G3 and G4 exists, thats why ... 't find any subgraph homoemorphic to K5 in G1 as a graph is non planar iff it contains a subgraph homoemorphic to K5 or K3,3...
dhingrak
asked
in
Graph Theory
Dec 14, 2014
by
dhingrak
786
views
graph-theory
graph-planarity
Page:
1
2
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(855)
Recent questions tagged graph-planarity
Recent Blog Comments
The counts of answered, marked etc in the exam...
Tests have been sent and all tests will be...
@GO Classes @Deepak Poonia @Sachin...
@GO Classes @Deepak Poonia sir...
Maximum age limit changed from 35 yrs. to 28...