Binding number and tenacity

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


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 [11]. In this paper, we provide a stronger lower bound on T(G) that is best possible when bind(G) ≥ 1.

Original languageEnglish (US)
Pages (from-to)185-196
Number of pages12
JournalJournal of Combinatorial Mathematics and Combinatorial Computing
StatePublished - Nov 1 2014

All Science Journal Classification (ASJC) codes

  • General Mathematics


Dive into the research topics of 'Binding number and tenacity'. Together they form a unique fingerprint.

Cite this