Unique Strong Isolate Semitotal Domination in Graphs

Objective: This study introduces a new domination parameter called “Unique strong isolate semitotal domination”. Methods: A unique strong isolated semitotal dominating set(USISTD-set) D of a graph G is an isolated semitotal dominating set(ISTD-set) in which there exists exactly one vertex such that...

Full description

Saved in:
Bibliographic Details
Published inIndian journal of science and technology Vol. 17; no. 33; pp. 3442 - 3446
Main Authors Mutharasu, Sivagnanam, Nithya, D
Format Journal Article
LanguageEnglish
Published 24.08.2024
Online AccessGet full text

Cover

More Information
Summary:Objective: This study introduces a new domination parameter called “Unique strong isolate semitotal domination”. Methods: A unique strong isolated semitotal dominating set(USISTD-set) D of a graph G is an isolated semitotal dominating set(ISTD-set) in which there exists exactly one vertex such that . Findings: This study gives the USISTD-number of some special graphs. Also, it discusses about the non-existence of USISTD-number in some graphs. Novelty: A few findings of a new domination parameter called unique strong islolate semitotal domination of some special graphs have been established. AMS subject classification: 05C69 Keywords: Isolate semitotal domination, Unique strong isolate semitotal domination, Comb graph, Helm graph, Flower graph, Excellent graph
ISSN:0974-6846
0974-5645
DOI:10.17485/IJST/v17i33.1785