On Secure Total Domination Cover Pebbling Number

In this paper, we introduce a new graph invariant called the secure total domination cover pebbling number, a combination of two graph invariants, namely, `secure total domination' and `cover pebbling number'. The secure total domination cover pebbling number of a graph \(G\), denoted by \...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Communications in Mathematics and Applications 2022-01, Vol.13 (1), p.117-127
Hauptverfasser:	Surya, S. Sarah, Mathew, Lian
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Graph theory Graphs Invariants Mathematics
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!