Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Graph Theory Concept
|
| gptkbp:contrastsWith |
gptkb:Disconnected_Graph
|
| gptkbp:defines |
An undirected graph in which there is a path between every pair of vertices.
|
| gptkbp:hasApplication |
gptkb:Communication_Networks
Social Networks Transportation Networks |
| gptkbp:hasProperty |
Connectivity
|
| https://www.w3.org/2000/01/rdf-schema#label |
Connected Undirected Graph
|
| gptkbp:isA |
gptkb:Undirected_Graph
|
| gptkbp:maximumEdges |
n(n-1)/2 (for n vertices)
|
| gptkbp:mayInclude |
gptkb:tree
Cycle |
| gptkbp:minimumEdges |
n-1 (for n vertices)
|
| gptkbp:relatedTo |
gptkb:Spanning_Tree
gptkb:Bridge_(Graph_Theory) gptkb:Component_(Graph_Theory) gptkb:Cut_Vertex |
| gptkbp:usedIn |
gptkb:Mathematics
Computer Science Network Design |
| gptkbp:bfsParent |
gptkb:Spanning_Tree_Algorithm
|
| gptkbp:bfsLayer |
6
|