Register

Recent questions tagged graph-planarity

347
views
1 answers
0 votes
ISRO 2024
If there are five faces and nine vertices in an undirected planar graph, then number of edges is14612None of the above
User Avatar
388
views
1 answers
1 votes
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 ... planar but Now if i draw i dont intersect any edges .,which show it is planar
User Avatar
582
views
1 answers
0 votes
Planar Graphs | Graph Theory | Selfdoubt
In a Connected Planar Bipartite Graph of order 10 atmost how many edges be present ?
User Avatar
382
views
0 answers
1 votes
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?
User Avatar
1.2k
views
1 answers
0 votes
Self Doubt - Planarity of Complete Bipartite Graph
How to determine for which m, n the complete bipartite graph $Km,n$ ... http://www.matthewkahle.org/download/file/fid/573Need a proper proof of the solution.
User Avatar
439
views
1 answers
2 votes
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 is connected if and only if $n \geq 5.$
User Avatar
493
views
0 answers
2 votes
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 ... \ell < 21$21\leq \ell< 22$22\leq \ell< 23$23\leq \ell< 24$
User Avatar
8.5k
views
5 answers
13 votes
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 _________.
User Avatar
2.2k
views
1 answers
1 votes
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$
User Avatar
1.4k
views
1 answers
1 votes
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$
User Avatar
3.1k
views
1 answers
1 votes
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$
User Avatar
777
views
1 answers
1 votes
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$
User Avatar
8.3k
views
4 answers
0 votes
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
User Avatar
3.0k
views
2 answers
0 votes
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 ... that any pair of edges meet only at their end vertices.None of the option.
User Avatar
8.9k
views
1 answers
7 votes
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$
User Avatar
2.1k
views
0 answers
1 votes
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)ConnectivityMatchingColoringCutsCoveringIndependent ... please recommend a reliable and simple resource to go with.
User Avatar
871
views
0 answers
1 votes
Planar graph
In a connected 3 regular graph, every planar region is bounded by exactly 5 edges, then count no of edges?
User Avatar
3.6k
views
1 answers
0 votes
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 ?
User Avatar
1.8k
views
1 answers
0 votes
Planar Graph
Can minimum degree of a planar graph be $5$? Give some example
User Avatar
2.8k
views
1 answers
2 votes
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 ... count no of edges?Please explain the last QS with the help of Euler's equation.
User Avatar
784
views
1 answers
2 votes
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}}$ edgesIf the plane is ... $\large\color{maroon}{\text{r}}$ ?
User Avatar
1.4k
views
1 answers
1 votes
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
User Avatar
8.1k
views
4 answers
31 votes
GATE CSE 1989 | Question: 3-vi
Which of the following graphs is/are planar?
User Avatar
12.9k
views
2 answers
28 votes
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}$ ... $k_{5}$ or $k_{3, 3}$.
User Avatar
Page: