On the Strong Secure Domination Number of a Graph

被引：0
|
作者：
Alsuraiheed, Turki [1 ]
Mercy, J. Annaal [2 ]
Raj, L. Benedict Michael [2 ]
Asir, Thangaraj [3 ]
机构：
[1] King Saud Univ, Coll Sci, Dept Math, Riyadh 11451, Saudi Arabia
[2] Bharathidasan Univ, Dept Math, St Josephs Coll, Trichy 620002, India
[3] Pondicherry Univ, Dept Math, Pondicherry 605014, India
来源：
MATHEMATICS | 2024年 / 12卷 / 11期
关键词：
secure domination; strong secure domination; tree; vertex gluing;
D O I：
10.3390/math12111666
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper, we characterize trees with a strong secure domination number less than or equal to 4 and compute this parameter for certain classes of graphs. Also, we investigate bounds for the strong secure domination number of vertex gluing of two graphs.
引用
收藏
页数：10
相关论文
共 50 条
  • [1] Secure domination subdivision number of a graph
    Rashmi, S. V. Divya
    Somasundaram, A.
    Arumugam, S.
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2019, 11 (03)
  • [2] Strong domination number of some operations on a graph
    Alikhani, Saeid
    Ghanbari, Nima
    Zaherifar, Hassan
    COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 2024, 9 (04) : 773 - 783
  • [3] A lower bound for secure domination number of an outerplanar graph
    Araki, Toru
    DISCRETE APPLIED MATHEMATICS, 2024, 357 : 81 - 85
  • [4] On the domination number of a graph
    Pruchnewski, A
    DISCRETE MATHEMATICS, 2002, 251 (1-3) : 129 - 136
  • [5] Inequalities between strong, weak domination numbers and chromatic number of a graph
    Thangaraju, P.
    UTILITAS MATHEMATICA, 2018, 108 : 221 - 229
  • [6] Strong weak domination and domination balance in a graph
    Sampathkumar, E
    Latha, LP
    DISCRETE MATHEMATICS, 1996, 161 (1-3) : 235 - 242
  • [7] φ-Strong(weak) domination in a graph
    Swaminathan, V
    Thangaraju, P
    ARS COMBINATORIA, 2003, 69 : 241 - 248
  • [8] Secure domination of some graph operators
    Manju K. Menon
    M. R. Chithra
    Indian Journal of Pure and Applied Mathematics, 2023, 54 : 1170 - 1176
  • [9] Edge stability in secure graph domination
    Burger, Anton Pierre
    De Villiers, Alewyn Petrus
    van Vuuren, Jan Harm
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2015, 17 (01): : 103 - 122
  • [10] Edge criticality in secure graph domination
    Burger, A. P.
    de Villiers, A. P.
    van Vuuren, J. H.
    DISCRETE OPTIMIZATION, 2015, 18 : 111 - 122
12345