1
Question
Which of the following is not a type of graph?
Which of the following is not a type of graph?
Open in App
Solution
The correct option is D Path
Path is not a type of
graph.
A graph is a collection of points, called
vertices, and lines between those points, called edges. There are many different types of graphs, such as connected and disconnected graphs, bipartite graphs, weighted graphs, directed and undirected graphs, and simple graphs.
A path such that no graph edges connect two nonconsecutive path vertices is called an induced path. A path that includes every vertex of the graph is known as a hamiltonian path. Two paths are vertex-independent if they do not have any internal vertex in common.
Path is not a type of graph.
A graph is a collection of points, called vertices, and lines between those points, called edges. There are many different types of graphs, such as connected and disconnected graphs, bipartite graphs, weighted graphs, directed and undirected graphs, and simple graphs.
A path such that no graph edges connect two nonconsecutive path vertices is called an induced path. A path that includes every vertex of the graph is known as a hamiltonian path. Two paths are vertex-independent if they do not have any internal vertex in common.
Suggest Corrections
0
Similar questions
View More
Join BYJU'S Learning Program
Explore more
Join BYJU'S Learning Program
