graph toughness
Noun
Meaning
graph toughness (uncountable)
(mathematics) A measure, expressed by a positive integer (with the exception of complete graphs), of the connectivity of a graph.
Noun
graph toughness (uncountable)
(mathematics) A measure, expressed by a positive integer (with the exception of complete graphs), of the connectivity of a graph.