Secure domination;
Protection of a graph;
Edge-removal-critical graph;
ER-critical graph;
ROMAN-EMPIRE;
PROTECTION;
TREES;
D O I:
10.1016/j.disc.2008.05.050
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
A Secure dominating set X of a graph G is a dominating set with the property that each vertex u is an element of V-G - X is adjacent to a vertex nu is an element of X such that (X - {nu}) U {u} is dominating. The minimum cardinality of such a set is called the secure domination number, denoted by gamma(s)(G). We are interested in the effect of edge removal on gamma(s)(G), and characterize gamma(s) ER-critical graphs, i.e. graphs for which gamma(s)(G - e) > gamma(s)(G) for any edge e of G, bipartite gamma(s)-ER-critical graphs and gamma(s)-ER-critical trees. (C) 2008 Elsevier B.V. All rights reserved.
机构:
Univ Johannesburg, Dept Pure & Appl Math, Johannesburg, South AfricaUniv Johannesburg, Dept Pure & Appl Math, Johannesburg, South Africa
Henning, Michael A.
Klavzar, Sandi
论文数: 0引用数: 0
h-index: 0
机构:
Univ Ljubljana, Fac Math & Phys, Ljubljana, Slovenia
Univ Maribor, Fac Nat Sci & Math, Maribor, Slovenia
Inst Math Phys & Mech, Ljubljana, SloveniaUniv Johannesburg, Dept Pure & Appl Math, Johannesburg, South Africa
Klavzar, Sandi
Rall, Douglas F.
论文数: 0引用数: 0
h-index: 0
机构:
Furman Univ, Dept Math, Greenville, SC 29613 USAUniv Johannesburg, Dept Pure & Appl Math, Johannesburg, South Africa
机构:
Curtin Univ, WACEIO, Dept Math & Stat, GPO Box U1987, Perth, WA 6845, AustraliaCurtin Univ, WACEIO, Dept Math & Stat, GPO Box U1987, Perth, WA 6845, Australia
Kaemawichanurat, P.
Caccetta, L.
论文数: 0引用数: 0
h-index: 0
机构:
Curtin Univ, WACEIO, Dept Math & Stat, GPO Box U1987, Perth, WA 6845, AustraliaCurtin Univ, WACEIO, Dept Math & Stat, GPO Box U1987, Perth, WA 6845, Australia
Caccetta, L.
Ananchuen, W.
论文数: 0引用数: 0
h-index: 0
机构:
Sukhothai Thammathirat Open Univ, Sch Liberal Arts, Pakkred 11120, Nonthaburi, ThailandCurtin Univ, WACEIO, Dept Math & Stat, GPO Box U1987, Perth, WA 6845, Australia