MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Quadrilaterals and Their Properties

The minimum n...

Question

The minimum number of edges in a connected graph with in vertices is

A

n - 1

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

B

None of these

No worries! We‘ve got your back. Try BYJU‘S free classes today!

C

n

No worries! We‘ve got your back. Try BYJU‘S free classes today!

D

n + 1

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is A n - 1
option (a)

A simple connected graph with minimum number of edges is a tree.
A tree with n vertices has n - 1 edges.

Suggest Corrections

thumbs-up

2

Similar questions

Q. In an undirected connected planar graph G, there are eight vertices and five faces. The number of edges in G is

Q. 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

Q. What is the maximum number of edges in an acyclic undirected graph with n vertices?

Q. 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

Q. The maximum number of edges in a bipartite graph on 12 vertices is

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Quadrilaterals and their Properties

MATHEMATICS

Watch in App

explore_more_icon

Explore more

Quadrilaterals and Their Properties

Standard VIII Mathematics

Join BYJU'S Learning Program

CrossIcon