Article ID Journal Published Year Pages File Type
428629 Information Processing Letters 2011 5 Pages PDF
Abstract

Let a,b,ka,b,k be nonnegative integers with 2⩽a

Research highlights► We give some relations between toughness and (a,b,k)(a,b,k)-critical graphs. ► We obtain a result on (a,b,k)(a,b,k)-critical graphs depending on toughness and minimum degree. ► We show the main result in this paper is best possible in some sense.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Toughness and (a,b,k)(a,b,k)-critical graphs
Authors
, ,