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...

Full description

Bibliographic Details

Published in:	Journal of Mathematics Vol. 2022; no. 1
Main Authors:	Varghese, Eddith Sarah, Xavier, D. Antony, Alsinai, Ammar, Mathew, Deepa, Amirtha Raja, S. Arul, Ahmed, Hanan
Format:	Journal Article
Language:	English
Published:	Cairo Hindawi 2022 John Wiley & Sons, Inc Wiley
Subjects:	Apexes Graphs Mathematics Police Vertex sets India
ISSN:	2314-4629, 2314-4785
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!