TY - JOUR
ID - 7950
TI - The edge tenacity of a split graph
JO - Journal of Algorithms and Computation
JA - JAC
LA - en
SN - 2476-2776
AU - Bafandeh Mayvan, Bahareh
AD - Department of Computer Engineering, Ferdowsi University of Mashhad
Y1 - 2016
PY - 2016
VL - 47
IS - 1
SP - 119
EP - 125
KW - Vertex degree
KW - split graphs
KW - edge tenacity
DO - 10.22059/jac.2016.7950
N2 - The edge tenacity Te(G) of a graph G is dened 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] .
UR - https://jac.ut.ac.ir/article_7950.html
L1 - https://jac.ut.ac.ir/article_7950_79987a74d7a89e4dc593ea40d6df17ea.pdf
ER -