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
ISRO 2024
If there are five faces and nine vertices in an undirected planar graph, then number of edges is 14 6 12 None of the above
Ramayya
asked
in
Graph Theory
Jan 7
by
Ramayya
255
views
isro-2024
graph-theory
graph-planarity
1
vote
1
answer
2
Planar Graph (Self Doubt)
This is a graph ? Is it planar or not ? As per definition of planar graph it can be drawn in such a way that no edges cross each other. other theorems are if a connected simple graph is planar→ e<=3n-6 if a connected simple graph is planar → ... for planar graph not meet if the graph is planar but Now if i draw i dont intersect any edges .,which show it is planar
Rajib Datta Roy
asked
in
Algorithms
Jul 18, 2023
by
Rajib Datta Roy
295
views
self-doubt
graph-theory
graph-planarity
discrete-mathematics
0
votes
1
answer
3
Planar Graphs | Graph Theory | Selfdoubt
In a Connected Planar Bipartite Graph of order 10 atmost how many edges be present ?
Dhiraj_777
asked
in
Graph Theory
May 4, 2023
by
Dhiraj_777
481
views
self-doubt
graph-planarity
graph-theory
1
vote
0
answers
4
TestBook graph theory question
If G is a simple planar connected graph with 5 vertices, how many edges in maximum can be there in the given graph?
Sahil_Lather
asked
in
Graph Theory
Jan 27, 2023
by
Sahil_Lather
351
views
graph-theory
testbook-test-series
graph-planarity
0
votes
1
answer
5
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, 2022
by
Abhrajyoti00
1.0k
views
graph-theory
bipartite-graph
discrete-mathematics
graph-planarity
2
votes
1
answer
6
GO Classes Test Series 2024 | Discrete Mathematics | Test 5 | Question: 18
Which of the following statements about simple graphs are true ? Two complete graphs on $m,n$ vertices respectively, are isomorphic to each other if and only if $m=n.$ Wheel graph on $n$ vertices, $n \geq 4,$ is never ... always planar graph. Complement of a cycle graph on $n$ vertices is connected if and only if $n \geq 5.$
GO Classes
asked
in
Graph Theory
May 11, 2022
by
GO Classes
364
views
goclasses2024-dm-5-weekly-quiz
goclasses
graph-theory
graph-planarity
multiple-selects
2-marks
2
votes
0
answers
7
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
451
views
tifr2021
graph-theory
graph-planarity
13
votes
5
answers
8
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
8.0k
views
gatecse-2021-set1
graph-theory
graph-planarity
numerical-answers
easy
1-mark
1
vote
1
answer
9
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$
admin
asked
in
Graph Theory
Mar 31, 2020
by
admin
2.1k
views
nielit2017dec-assistanta
discrete-mathematics
graph-theory
graph-planarity
1
vote
1
answer
10
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$
admin
asked
in
Graph Theory
Mar 31, 2020
by
admin
1.3k
views
nielit2016dec-scientistb-cs
discrete-mathematics
graph-theory
graph-planarity
1
vote
1
answer
11
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$
admin
asked
in
Graph Theory
Mar 30, 2020
by
admin
3.0k
views
nielit2017july-scientistb-it
discrete-mathematics
graph-theory
graph-planarity
1
vote
1
answer
12
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$
admin
asked
in
Graph Theory
Mar 30, 2020
by
admin
717
views
nielit2017july-scientistb-it
discrete-mathematics
graph-theory
graph-planarity
0
votes
4
answers
13
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
admin
asked
in
Graph Theory
Mar 30, 2020
by
admin
8.0k
views
nielit2017july-scientistb-cs
discrete-mathematics
graph-theory
graph-planarity
0
votes
2
answers
14
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.
admin
asked
in
Graph Theory
Mar 30, 2020
by
admin
2.9k
views
nielit2017july-scientistb-cs
discrete-mathematics
graph-theory
graph-planarity
7
votes
1
answer
15
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
8.4k
views
ugcnetcse-june2019-paper2
graph-planarity
handshaking-theorem
1
vote
0
answers
16
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.9k
views
syllabus
engineering-mathematics
graph-theory
graph-planarity
graph-isomorphism
vertex-cover
1
vote
0
answers
17
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
789
views
graph-theory
graph-planarity
0
votes
1
answer
18
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.5k
views
graph-theory
graph-planarity
0
votes
1
answer
19
Planar Graph
Can minimum degree of a planar graph be $5$? Give some example
srestha
asked
in
Graph Theory
Oct 22, 2018
by
srestha
1.6k
views
graph-theory
graph-planarity
2
votes
1
answer
20
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.6k
views
graph-theory
graph-planarity
2
votes
1
answer
21
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 19, 2016
by
dd
730
views
graph-theory
graph-planarity
1
vote
1
answer
22
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 3, 2016
by
sh!va
1.3k
views
graph-theory
graph-planarity
31
votes
4
answers
23
GATE CSE 1989 | Question: 3-vi
Which of the following graphs is/are planar?
makhdoom ghaya
asked
in
Graph Theory
Nov 27, 2016
by
makhdoom ghaya
7.7k
views
gate1989
normal
graph-theory
graph-planarity
descriptive
27
votes
2
answers
24
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
12.5k
views
gate1990
normal
graph-theory
graph-planarity
multiple-selects
Page:
1
2
next »
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)
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 questions tagged graph-planarity
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:...