graph toughness

Summary

graph toughness is a graph property^[1]. It draws 7 Wikipedia views per month (graph_property category, ranking #24 of 43).^[2]

Key Facts

• graph toughness's image is recorded as Graph toughness.svg^[3].
• graph toughness's instance of is recorded as graph property^[4].
• graph toughness's Freebase ID is recorded as /m/027lkrb^[5].
• graph toughness's described at URL is recorded as https://www.findstat.org/StatisticsDatabase/St000699/^[6].
• graph toughness's codomain is recorded as projectively extended real line^[7].
• graph toughness's defining formula is recorded as \tau(G)=\min({|S|/\mathrm{cc}(G-S) \mid S\subset V(G),\, \mathrm{cc}(G-S)>1}\cup {\infty})^[8].
• graph toughness's maintained by WikiProject is recorded as WikiProject Mathematics^[9].
• graph toughness's Microsoft Academic ID is recorded as 205858151^[10].
• graph toughness's in defining formula is recorded as \tau(G)^[11].
• graph toughness's in defining formula is recorded as S^[12].
• graph toughness's in defining formula is recorded as \mathrm{cc}^[13].
• graph toughness's in defining formula is recorded as V^[14].
• graph toughness's introduced in is recorded as Tough graphs and hamiltonian circuits^[15].

Why It Matters

graph toughness draws 7 Wikipedia views per month (graph_property category, ranking #24 of 43).^[2] It has Wikipedia articles in 5 language editions, a strong signal of global cultural recognition.^[16] It is known by 3 alternative names across languages and contexts.^[17]