Vulnerability parameters of split graphs

Authors:
Yinkui Li;Shenggui Zhang;Qilong Zhang
Affiliations:
Department of Mathematics, Qinghai Nationalities College, Xining, Qinghai, P.R. China;Department of Applied Mathematics, Northwestern Polytechnical University, Xi'an, Shaanxi, P.R. China;Department of Applied Mathematics, Northwestern Polytechnical University, Xi'an, Shaanxi, P.R. China
Venue:
International Journal of Computer Mathematics
Year:
2008

Citing 3
Cited 1

The toughness of split graphs

Discrete Mathematics
A combinatorial algorithm minimizing submodular functions in strongly polynomial time

Journal of Combinatorial Theory Series B
Graph Theory With Applications

Graph Theory With Applications

Edge vulnerability parameters of bisplit graphs

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

By rewriting the problem of computing the scattering number of a split graph as minimization of a submodular function on a crossing family, we show that this problem can be solved in polynomial time. At the same time, three other vulnerability parameters, namely, the integrity, tenacity and rupture degree of split graphs are determined.