A new lower bound on the tenacity ?of a graph G in terms of its connectivity and genus is obtained. The lower bound and interrelationship involving tenacity and other well-known graphical parameters are considered, an...A new lower bound on the tenacity ?of a graph G in terms of its connectivity and genus is obtained. The lower bound and interrelationship involving tenacity and other well-known graphical parameters are considered, and another formulation introduced from further bounds are derived.展开更多
文摘A new lower bound on the tenacity ?of a graph G in terms of its connectivity and genus is obtained. The lower bound and interrelationship involving tenacity and other well-known graphical parameters are considered, and another formulation introduced from further bounds are derived.
