Disconnected Graph

Revision as of 02:56, 17 June 2021 by Gmelli (talk | contribs) (Text replacement - ". ---- " to ". ---- ")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

A Disconnected Graph is a graph composed of two or more graph components.

AKA: Unconnected Graph.
- …
Counter-Example(s):
- a Connected Graph.
See: Graph Path, Concept Space.

Retrieved from "http://www.gabormelli.com/RKB/index.php?title=Disconnected_Graph&oldid=685833"