Statements (10)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:concerns |
connectivity
|
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Harary's theorem
|
| gptkbp:namedAfter |
gptkb:Frank_Harary
|
| gptkbp:publicationYear |
1962
|
| gptkbp:publishedIn |
gptkb:Journal_of_the_Indian_Mathematical_Society
|
| gptkbp:state |
A graph is k-connected if and only if it has at least k+1 vertices and deleting any set of fewer than k vertices leaves the graph connected.
|
| gptkbp:bfsParent |
gptkb:Frank_Harary
|
| gptkbp:bfsLayer |
7
|