Let T(G) and bind(G) be the tenacity and the binding number, respectively, of a graph G. The inequality T(G) ≥ bind(G) - 1 was derived by D. Moazzami in . In this paper, we provide a stronger lower bound on T(G) that is best possible when bind(G) ≥ 1.
|Original language||English (US)|
|Number of pages||12|
|Journal||Journal of Combinatorial Mathematics and Combinatorial Computing|
|State||Published - Nov 1 2014|
All Science Journal Classification (ASJC) codes