Vulnerability parameters of split graphs

Yinkui Li; Shenggui Zhang; Qilong Zhang

doi:10.1080/00207160701365721

Vulnerability parameters of split graphs

Yinkui Li, Shenggui Zhang, Qilong Zhang

School of Mathematics and Statistics

Research output: Contribution to journal › Article › peer-review

16 Scopus citations

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.

Original language	English
Pages (from-to)	19-23
Number of pages	5
Journal	International Journal of Computer Mathematics
Volume	85
Issue number	1
DOIs	https://doi.org/10.1080/00207160701365721
State	Published - Jan 2008

Keywords

Integrity
Rupture degree
Scattering number
Split graph
Submodular function
Tenacity

Access to Document

10.1080/00207160701365721

Cite this

@article{db1d70281cc44779a140489cf1e2ee64,

title = "Vulnerability parameters of split graphs",

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.",

keywords = "Integrity, Rupture degree, Scattering number, Split graph, Submodular function, Tenacity",

author = "Yinkui Li and Shenggui Zhang and Qilong Zhang",

year = "2008",

month = jan,

doi = "10.1080/00207160701365721",

language = "英语",

volume = "85",

pages = "19--23",

journal = "International Journal of Computer Mathematics",

issn = "0020-7160",

publisher = "Taylor and Francis Ltd.",

number = "1",

}

TY - JOUR

T1 - Vulnerability parameters of split graphs

AU - Li, Yinkui

AU - Zhang, Shenggui

AU - Zhang, Qilong

PY - 2008/1

Y1 - 2008/1

N2 - 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.

AB - 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.

KW - Integrity

KW - Rupture degree

KW - Scattering number

KW - Split graph

KW - Submodular function

KW - Tenacity

UR - http://www.scopus.com/inward/record.url?scp=37749028499&partnerID=8YFLogxK

U2 - 10.1080/00207160701365721

DO - 10.1080/00207160701365721

M3 - 文章

AN - SCOPUS:37749028499

SN - 0020-7160

VL - 85

SP - 19

EP - 23

JO - International Journal of Computer Mathematics

JF - International Journal of Computer Mathematics

IS - 1

ER -

Vulnerability parameters of split graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this