A Study on the Toughness of Certain Graphs

Toughness and Maximum Extension of Certain \(t\)-Tough Sets of the Bloom Graph \(B_{m,n}\), \(m\ge 3\), \(n\ge 3\)

“…The toughness of cubic graphs was investigated by Goddard [10]. Cynthia et al [5] investigated the toughness of cyclic split graphs and generalised prism graphs. The toughness and extension of certain t-tough sets of the mesh graphs were established by Cynthia et al [6].…”