A set D of a vertices in a graph G = (V, E) is said to be a total dominating set of G if every vertex in V is adjacent to some vertex in D. The total domination number gamma(t)(G) is the minimum cardinality of a total dominating set. If gamma(t)(G) not equal |V (G)|, the minimum cardinality of a set E-0 subset of E(G), such that G- E-0 contains no isolated vertices and gamma(t)(GE(0)) > gamma(t)(G), is called the total bondage number of G. In this paper, we improve the earlier known upper bounds for the total bondage number of a graph.
机构:
Lanzhou Univ, Sch Math & Stat, Lanzhou 730000, Gansu, Peoples R China
Jianghan Univ, Inst Interdisciplinary Res, Wuhan, Hubei, Peoples R ChinaLanzhou Univ, Sch Math & Stat, Lanzhou 730000, Gansu, Peoples R China
Zhao, Weisheng
Zhang, Heping
论文数: 0引用数: 0
h-index: 0
机构:
Lanzhou Univ, Sch Math & Stat, Lanzhou 730000, Gansu, Peoples R ChinaLanzhou Univ, Sch Math & Stat, Lanzhou 730000, Gansu, Peoples R China