@article {
author = {Bafandeh Mayvan, Bahareh},
title = {The edge tenacity of a split graph},
journal = {Journal of Algorithms and Computation},
volume = {47},
number = {1},
pages = {119-125},
year = {2016},
publisher = {University of Tehran},
issn = {2476-2776},
eissn = {2476-2784},
doi = {10.22059/jac.2016.7950},
abstract = {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] .},
keywords = {Vertex degree,split graphs,edge tenacity},
url = {https://jac.ut.ac.ir/article_7950.html},
eprint = {https://jac.ut.ac.ir/article_7950_79987a74d7a89e4dc593ea40d6df17ea.pdf}
}