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

Saved in:
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!
Description
Summary: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 vertices in T. The cardinality of strong total monophonic set which is minimum is defined as strong total monophonic number, denoted by smtG. We proved the NP-completeness of strong total monophonic set for general graphs. The strong total monophonic number of certain graphs and networks is derived. If l,m,n are positive integers with 5≤l≤m≤n and m≤2l−1, then we can construct a connected graph G with strong monophonic number l and strong total monophonic number m.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2314-4629
2314-4785
DOI:10.1155/2022/6194734