169k views
0 votes
What is a graph that consists of points that are not connected?

1 Answer

1 vote

Answer:

A circuit that doesn't repeat vertices is called a cycle. A graph is said to be connected if any two of its vertices are joined by a path. A graph that is not connected is a disconnected graph. A disconnected graph is made up of connected subgraphs that are called components.

User Mwcz
by
8.6k points

No related questions found

Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

9.4m questions

12.2m answers

Categories