GATE 2021 CS (CS1) – Question 26
Engineering Mathematics · Discrete Mathematics: Graphs (Connectivity, Matching, Colouring) · 1 mark · Numerical answer
In an undirected connected planar graph $G$, there are eight vertices and five faces. The number of edges in $G$ is ______.
Practise this question in The GATE Grind →
Show answer and explanation
Correct answer: 11
Explanation
Euler's formula V - E + F = 2 gives E = 8 + 5 - 2 = 11.
More Discrete Mathematics: Graphs (Connectivity, Matching, Colouring) questions
- GATE 2020 CS Q62 – Graph G is obtained by adding vertex s to K 3,4 and making s adjacent to every vertex of K…
- GATE 2019 CS Q22 – Let G be an undirected complete graph on n vertices, where n>2. Then the number of…
- GATE 2019 CS Q56 – Let T be a full binary tree with 8 leaves. (A full binary tree has every level full.)…
- GATE 2018 CS Q28 – The chromatic number of the following graph is .
- GATE 2018 CS Q53 – Let G be a graph with 100! vertices, with each vertex labelled by a distinct permutation…
- GATE 2015 CS (CS1) Q44 – Let G be a connected planar graph with 10 vertices. If the number of edges on each face is…
All Discrete Mathematics: Graphs (Connectivity, Matching, Colouring) questions →