On the Strong Secure Domination Number of a Graph

Turki Alsuraiheed; J. Annaal Mercy; L. Benedict Michael Raj; Thangaraj Asir

doi:10.3390/math12111666

Mathematics (May 2024)

On the Strong Secure Domination Number of a Graph

Turki Alsuraiheed,
J. Annaal Mercy,
L. Benedict Michael Raj,
Thangaraj Asir

Affiliations

Turki Alsuraiheed: Department of Mathematics, College of Science, King Saud University, Riyadh 11451, Saudi Arabia
J. Annaal Mercy: Department of Mathematics, St. Joseph’s College, Affiliated to Bharathidasan University, Trichy 620002, India
L. Benedict Michael Raj: Department of Mathematics, St. Joseph’s College, Affiliated to Bharathidasan University, Trichy 620002, India
Thangaraj Asir: Department of Mathematics, Pondicherry University, Puducherry 605014, India

DOI: https://doi.org/10.3390/math12111666
Journal volume & issue: Vol. 12, no. 11
p. 1666

Abstract

Read online

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.

Published in Mathematics

ISSN: 2227-7390 (Online)
Publisher: MDPI AG
Country of publisher: Switzerland
LCC subjects: Science: Mathematics
Website: http://www.mdpi.com/journal/mathematics

About the journal

Abstract

Keywords