Evaluation of ESC-domination number for some product graphs

Evaluation of ESC-domination number for some product graphs

A dominating set S ⊆ V is said to be an External Staircase Corona Dominating set ∼ (ESCD-set), if every vertex in < S > is either a pendent vertex or a support vertex and < V − S > = rk2. The smallest cardinality of an external staircase corona domination number (ESCD-number) of G and is...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Priya, K., Mahadevan, G., Sivagnanam, C.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Graphs
Staircases
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A dominating set S ⊆ V is said to be an External Staircase Corona Dominating set ∼ (ESCD-set), if every vertex in < S > is either a pendent vertex or a support vertex and < V − S > = rk2. The smallest cardinality of an external staircase corona domination number (ESCD-number) of G and is denoted by γESC(G) In this article, We examine this parameter for a few graphs that relate to products.
ISSN:0094-243X
1551-7616
DOI:10.1063/5.0224515