Article

On the Toughness of a Graph

Published in: Quaestiones Mathematicae
Volume 13 , issue 2 , 1990 , pages: 217–232

DOI: 10.1080/16073606.1990.9631613

Author(s): W. D. Goddard Department of Mathematics and Applied Mathematics, Durban , Henda C. Swart Department of Mathematics and Applied Mathematics, Durban

Keywords: 05C40

Download full text Get new issue alerts

Abstract

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.

« PRODUCTS OF CIRCULANT GRAPHS

A NOTE ON GRAPHS WHOSE DESTRUCTIONS YIELD COMPLETE SUBGRAPHS »