Strong Total Monophonic Problems in Product Graphs, Networks, and Its Computational Complexity

Let G be a graph with vertex set as VG and edge set as EG which is simple as well as connected. The problem of strong total monophonic set is to find the set of vertices T⊆VG, which contains no isolated vertices, and all the vertices in VG\T lie on a fixed unique chordless path between the pair of v...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of Mathematics Jg. 2022; H. 1
Hauptverfasser:	Varghese, Eddith Sarah, Xavier, D. Antony, Alsinai, Ammar, Mathew, Deepa, Amirtha Raja, S. Arul, Ahmed, Hanan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Cairo Hindawi 2022 John Wiley & Sons, Inc Wiley
Schlagworte:	Apexes Graphs Mathematics Police Vertex sets India
ISSN:	2314-4629, 2314-4785
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!