disconnected graphs
Description: Graphs that are not connected, meaning at least two vertices cannot be joined by a path; studied in graph theory and combinatorics.
Primary topic: Graph Labeling and Dimension Problems (27%)
Wikidata ID: wiki/Q138827270
OpenAlex ID: keywords/disconnected-graphs
