The edge tenacity Te(G) of a graph G is de ned as: Te(G) = min {[|X|+τ(G-X)]/[ω(G-X)-1]|X⊆ E(G) and ω(G-X) > 1} where the minimum is taken over every edge-cutset X that separates G into ω(G - X) components, and by τ(G - X) we denote the order of a largest component of G. The objective of this paper is to determine this quantity for split graphs. Let G = (Z; I; E) be a noncomplete connected split graph with minimum vertex degree δ(G) we prove that if δ(G)≥|E(G)|/[|V(G)|-1] then its edge-tenacity is |E(G)|/[|V(G)|-1] .
Bafandeh Mayvan,B . (2016). The edge tenacity of a split graph. Journal of Algorithms and Computation, 47(1), 119-125. doi: 10.22059/jac.2016.7950
MLA
Bafandeh Mayvan,B . "The edge tenacity of a split graph", Journal of Algorithms and Computation, 47, 1, 2016, 119-125. doi: 10.22059/jac.2016.7950
HARVARD
Bafandeh Mayvan B. (2016). 'The edge tenacity of a split graph', Journal of Algorithms and Computation, 47(1), pp. 119-125. doi: 10.22059/jac.2016.7950
CHICAGO
B Bafandeh Mayvan, "The edge tenacity of a split graph," Journal of Algorithms and Computation, 47 1 (2016): 119-125, doi: 10.22059/jac.2016.7950
VANCOUVER
Bafandeh Mayvan B. The edge tenacity of a split graph. J. Algo. Comp.. 2016;47(1):119-125. doi: 10.22059/jac.2016.7950
