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

数学与统计学院

Qinghai Nationalities College
Northwestern Polytechnical University Xian

科研成果: 期刊稿件 › 文章 › 同行评审

17 引用（Scopus）

摘要

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.

源语言	英语
页（从-至）	19-23
页数	5
期刊	International Journal of Computer Mathematics
卷	85
期	1
DOI	https://doi.org/10.1080/00207160701365721
出版状态	已出版 - 1月 2008

访问文件

10.1080/00207160701365721

其它文件与链接

链接到 Scopus 的出版物

引用此

@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 - https://www.scopus.com/pages/publications/37749028499

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

摘要

访问文件

其它文件与链接

指纹

引用此