The toughness of a toroidal graph with connectivity 3 and girth 6 is exactly 1 (Q1889826)

The toughness of a graph \(G,t(G),\) is defined by \(t(G)=\min \{\left| S\right| /c(G-S)\},\) where the minimum runs over all cutsets \(S\) of \(G,\) and \(c(G-S)\) is the number of components of \(G-S.\) The authors show that every \(3\)-connected graph of girth \(6,\) which can be embedded in the torus, has toughness exactly \(1.\)