The tenacity of a graph G, T(G), is de ned by T(G) = min{[|S|+τ(G-S)]/[ω(G-S)]}, where the minimum is taken over all vertex cutsets S of G. We de ne τ(G - S) to be the number of the vertices in the largest component of the graph G - S, and ω(G - S) be the number of components of G - S.In this paper a lower bound for the tenacity T(G) of a graph with genus γ(G) is obtained using the graph's connectivity κ(G). Then we show that such a bound for almost all toroidal graphs is best possible.
Doost Hosseini,H . (2016). Minimum Tenacity of Toroidal graphs. Journal of Algorithms and Computation, 47(1), 127-135. doi: 10.22059/jac.2016.7951
MLA
Doost Hosseini,H . "Minimum Tenacity of Toroidal graphs", Journal of Algorithms and Computation, 47, 1, 2016, 127-135. doi: 10.22059/jac.2016.7951
HARVARD
Doost Hosseini H. (2016). 'Minimum Tenacity of Toroidal graphs', Journal of Algorithms and Computation, 47(1), pp. 127-135. doi: 10.22059/jac.2016.7951
CHICAGO
H Doost Hosseini, "Minimum Tenacity of Toroidal graphs," Journal of Algorithms and Computation, 47 1 (2016): 127-135, doi: 10.22059/jac.2016.7951
VANCOUVER
Doost Hosseini H. Minimum Tenacity of Toroidal graphs. J. Algo. Comp.. 2016;47(1):127-135. doi: 10.22059/jac.2016.7951
