On the Strong Secure Domination Number of a Graph-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

On the Strong Secure Domination Number of a Graph

Published:2024-05-27 Issue:11 Volume:12 Page:1666
ISSN:2227-7390
Container-title:Mathematics
language:en
Short-container-title:Mathematics

Author:

Alsuraiheed Turki¹,Mercy J. Annaal²,Raj L. Benedict Michael²^ORCID,Asir Thangaraj³

Affiliation:

1. Department of Mathematics, College of Science, King Saud University, Riyadh 11451, Saudi Arabia

2. Department of Mathematics, St. Joseph’s College, Affiliated to Bharathidasan University, Trichy 620002, India

3. Department of Mathematics, Pondicherry University, Puducherry 605014, India

Abstract

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.

Funder

King Saud University

Publisher

MDPI AG

Link

https://www.mdpi.com/2227-7390/12/11/1666/pdf

Reference15 articles.

1. Chartrand, G., and Zhang, P. (2012). A First Course in Graph Theory, Dover Publications.

2. Haynes, T.W., Hedetniemi, S.T., and Slater, P.J. (2013). Fundamentals of Domination in Graphs, Marcel Dekkar, Inc.

3. Strong weak domination and domination balance in a graph;Sampathkumar;Discret. Math.,1996

4. Bounds on the strong domination number graphs;Rautenbach;Discret. Math.,2000

5. The influence of special vertices on strong domination;Rautenbach;Discret. Math.,1999

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP