every disconnected graph has on isolated vertex true ya false answer​

  • matematika

    Subject:

    Math
  • Author:

    bits
  • Created:

    1 year ago

Answers 1

Answer:

A graph is disconnected if at least two vertices of the graph are not connected by a path. If a graph G is disconnected, then every maximal connected subgraph of G is called a connected component of the graph.

Step-by-step explanation:

hope It helped you

If you know the answer add it here!

Can't find the answer?

Log in with Google

or

Forgot your password?

I don't have an account, and I want to Register

Choose a language and a region
How much to ban the user?
1 hour 1 day 100 years