Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:graph
|
| gptkbp:application |
network design
reliability analysis |
| gptkbp:citation |
Frank Harary, 'The maximum connectivity of a graph', Proceedings of the National Academy of Sciences, 1962
|
| gptkbp:definedIn |
gptkb:Frank_Harary
|
| gptkbp:introducedIn |
1962
|
| gptkbp:namedAfter |
gptkb:Frank_Harary
|
| gptkbp:property |
gptkb:simple_graph
gptkb:regular_graph gptkb:graph gptkb:symmetric_graph edge-transitive vertex-transitive no loops constructed for given n and k k-connected minimal number of edges for given connectivity minimally k-connected no multiple edges |
| gptkbp:usedIn |
graph theory
|
| gptkbp:bfsParent |
gptkb:Frank_Harary
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Harary graph
|