Secure domination critical graphs

被引:22
|
作者
Grobler, P. J. P. [2 ]
Mynhardt, C. M. [1 ]
机构
[1] Univ Victoria, Dept Math & Stat, Victoria, BC V8W 3R4, Canada
[2] Univ Stellenbosch, Dept Math Sci, ZA-7602 Matieland, South Africa
基金
加拿大自然科学与工程研究理事会;
关键词
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.
引用
收藏
页码:5820 / 5827
页数:8
相关论文
共 50 条
  • [41] Domination critical graphs with higher independent domination numbers
    Ao, S
    Cockayne, EJ
    MacGillivray, G
    Mynhardt, CM
    JOURNAL OF GRAPH THEORY, 1996, 22 (01) : 9 - 14
  • [42] On domination game stable graphs and domination game edge-critical graphs
    Xu, Kexiang
    Li, Xia
    DISCRETE APPLIED MATHEMATICS, 2018, 250 : 47 - 56
  • [43] Double domination edge critical graphs
    Haynes, Teresa W.
    Thacker, Derrick
    UTILITAS MATHEMATICA, 2009, 78 : 139 - 149
  • [44] Matching properties in domination critical graphs
    Ananchuen, N
    Plummer, MD
    DISCRETE MATHEMATICS, 2004, 277 (1-3) : 1 - 13
  • [45] WEAKLY CONNECTED DOMINATION CRITICAL GRAPHS
    Lemanska, Magdalena
    Patyk, Agnieszka
    OPUSCULA MATHEMATICA, 2008, 28 (03) : 325 - 330
  • [46] Game total domination critical graphs
    Henning, Michael A.
    Klavzar, Sandi
    Rall, Douglas F.
    DISCRETE APPLIED MATHEMATICS, 2018, 250 : 28 - 37
  • [47] Domination dot-critical graphs
    Burton, T
    Sumner, DP
    DISCRETE MATHEMATICS, 2006, 306 (01) : 11 - 18
  • [48] Hamiltonicity of Connected Domination Critical Graphs
    Kaemawichanurat, P.
    Caccetta, L.
    Ananchuen, W.
    ARS COMBINATORIA, 2018, 136 : 127 - 151
  • [49] THE DIAMETER OF EDGE DOMINATION CRITICAL GRAPHS
    PARIS, M
    NETWORKS, 1994, 24 (04) : 261 - 262
  • [50] Domination Critical Knödel Graphs
    D. A. Mojdeh
    S. R. Musawi
    E. Nazari
    Iranian Journal of Science and Technology, Transactions A: Science, 2019, 43 : 2423 - 2428