On the Toughness of a Graph
Wayne Goddard, Henda C. Swart · Quaestiones Mathematicae · 1990
In this paper, general results on the toughness of a graph are considered. Firstly the link between toughness and connectivity is explored and then results linking toughness and the parameters binding number and integrity are given. Further, the toughness of product graphs is discussed including general results for the lexicographic product. The paper concludes with some observations on toughness and hamiltoni-city.