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:
ISSN:2314-4629, 2314-4785
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract 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.
AbstractList 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.
Let G be a graph with vertex set as V ( G ) and edge set as E ( G ) which is simple as well as connected. The problem of strong total monophonic set is to find the set of vertices T ⊆ V ( G ), which contains no isolated vertices, and all the vertices in V ( G )\ 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 s m t ( G ). 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 ≤ 2 l − 1, then we can construct a connected graph G with strong monophonic number l and strong total monophonic number m .
Let G be a graph with vertex set as V(G) and edge set as E(G) which is simple as well as connected. The problem of strong total monophonic set is to find the set of vertices T⊆V(G), which contains no isolated vertices, and all the vertices in V(G) 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 sm[sub.t](G). 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.
Audience Academic
Author Amirtha Raja, S. Arul
Mathew, Deepa
Varghese, Eddith Sarah
Xavier, D. Antony
Ahmed, Hanan
Alsinai, Ammar
Author_xml – sequence: 1
  givenname: Eddith Sarah
  orcidid: 0000-0001-8236-5756
  surname: Varghese
  fullname: Varghese, Eddith Sarah
  organization: Department of MathematicsLoyola College (Affliated to the University of Madras)ChennaiIndia
– sequence: 2
  givenname: D. Antony
  orcidid: 0000-0002-3808-8592
  surname: Xavier
  fullname: Xavier, D. Antony
  organization: Department of MathematicsLoyola College (Affliated to the University of Madras)ChennaiIndia
– sequence: 3
  givenname: Ammar
  orcidid: 0000-0002-5221-0574
  surname: Alsinai
  fullname: Alsinai, Ammar
  organization: Department of Studies in MathematicsUniversity of MysoreManasagangothriMysuru - 570 006KarnatakaIndiauni-mysore.ac.in
– sequence: 4
  givenname: Deepa
  orcidid: 0000-0002-9410-8834
  surname: Mathew
  fullname: Mathew, Deepa
  organization: Department of MathematicsSt. Joseph’s CollegeBangaloreIndia
– sequence: 5
  givenname: S. Arul
  orcidid: 0000-0001-5920-0726
  surname: Amirtha Raja
  fullname: Amirtha Raja, S. Arul
  organization: Department of MathematicsSt. Joseph’s College of EngineeringChennaiIndiastjosephs.ac.in
– sequence: 6
  givenname: Hanan
  orcidid: 0000-0002-4008-4873
  surname: Ahmed
  fullname: Ahmed, Hanan
  organization: Department of MathematicsIbb UniversityIbbYemenibb-univ.net
BookMark eNp9kVtrFEEQhRuJYIx58wcM-Gg26evM9GNYTFxIomB8tanpy26vM91jdy8x_95eN4qCSD3UqeKrA8V5iY5CDBah1wSfEyLEBcWUXrRE8o7xZ-iYMsIXvOvF0S_dUvkCnea8xRgT2rNe4mP05VNJMayb-1hgbG5jiPMmBq-bjykOo51y48Nem50uzXWCeZPPmjtbHmL6WhUE06xKbpZxmncFio-h2uyn0X735fEVeu5gzPb0qZ-gz1fv7pfvFzcfrlfLy5uF5rQrC-p6onHP9SCB1abBtlLSwVnDgIDsCZPCYGycbYnrDdaWGFOldYR31LITtDr4mghbNSc_QXpUEbz6uYhprSAVr0erDFADVgO3w8C5a0FbLjEVgkLHteDV683Ba07x287morZxl-pfWdGOCMaJpH9Qa6imPrhYEujJZ60ue8aIwEKySp3_g6pl7OR1DdD5uv_r4OxwoFPMOVn3-xmC1T5ntc9ZPeVc8bcHfOODgQf_f_oHI8uoDA
Cites_doi 10.1137/0211015
10.12988/imf.2007.07153
10.2298/fil1206081j
10.1007/s40840-019-00833-6
10.35940/ijeat.a1231.109119
10.5539/jmr.v11n2p20
10.1016/j.disc.2009.09.018
10.1016/0895-7177(93)90259-2
10.7151/dmgt.2139
10.1016/j.disc.2006.08.002
10.1016/j.dam.2009.11.016
ContentType Journal Article
Copyright Copyright © 2022 Eddith Sarah Varghese et al.
COPYRIGHT 2022 John Wiley & Sons, Inc.
Copyright © 2022 Eddith Sarah Varghese et al. This is an open access article distributed under the Creative Commons Attribution License (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. https://creativecommons.org/licenses/by/4.0
Copyright_xml – notice: Copyright © 2022 Eddith Sarah Varghese et al.
– notice: COPYRIGHT 2022 John Wiley & Sons, Inc.
– notice: Copyright © 2022 Eddith Sarah Varghese et al. This is an open access article distributed under the Creative Commons Attribution License (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. https://creativecommons.org/licenses/by/4.0
DBID RHU
RHW
RHX
AAYXX
CITATION
3V.
7SC
7TB
7XB
8AL
8FD
8FE
8FG
8FK
ABJCF
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
FR3
GNUQQ
HCIFZ
JQ2
K7-
KR7
L6V
L7M
L~C
L~D
M0N
M7S
P62
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
Q9U
DOA
DOI 10.1155/2022/6194734
DatabaseName Hindawi Publishing Complete
Hindawi Publishing Subscription Journals
Hindawi Publishing Open Access
CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
Mechanical & Transportation Engineering Abstracts
ProQuest Central (purchase pre-March 2016)
Computing Database (Alumni Edition)
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Central
Technology Collection
ProQuest One Community College
ProQuest Central
Engineering Research Database
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
Civil Engineering Abstracts
ProQuest Engineering Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Computing Database
Engineering Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic (New)
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
ProQuest Central Basic
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
Publicly Available Content Database
Computer Science Database
ProQuest Central Student
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
Mechanical & Transportation Engineering Abstracts
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest Central Korea
ProQuest Central (New)
Advanced Technologies Database with Aerospace
Engineering Collection
Advanced Technologies & Aerospace Collection
Civil Engineering Abstracts
ProQuest Computing
Engineering Database
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
ProQuest One Academic UKI Edition
Materials Science & Engineering Collection
Engineering Research Database
ProQuest One Academic
ProQuest One Academic (New)
ProQuest Central (Alumni)
DatabaseTitleList
CrossRef
Publicly Available Content Database


Database_xml – sequence: 1
  dbid: RHX
  name: Hindawi Publishing Open Access
  url: http://www.hindawi.com/journals/
  sourceTypes: Publisher
– sequence: 2
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 3
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 2314-4785
Editor Ali, Akbar
Editor_xml – sequence: 1
  givenname: Akbar
  surname: Ali
  fullname: Ali, Akbar
ExternalDocumentID oai_doaj_org_article_da2daeca4ebb44f6ace4902552a74c54
A833150593
10_1155_2022_6194734
GeographicLocations India
GeographicLocations_xml – name: India
GroupedDBID 3V.
4.4
5VS
8FE
8FG
AAFWJ
AAJEY
ABJCF
ABUWG
ACIPV
ACIWK
ADBBV
AFKRA
AFPKN
ALMA_UNASSIGNED_HOLDINGS
ARAPS
AZQEC
BCNDV
BENPR
BGLVJ
BPHCQ
CCPQU
DWQXO
EBS
ESX
GNUQQ
GROUPED_DOAJ
HCIFZ
IAO
IHR
K6V
K7-
KQ8
L6V
M0N
M7S
OK1
PIMPY
PQQKQ
PROAC
PTHSS
RHU
RHW
RHX
0R~
24P
AAMMB
AAYXX
ACCMX
AEFGJ
AFFHD
AGXDD
AIDQK
AIDYY
ALUQN
AMVHM
CITATION
EJD
H13
ITC
PHGZM
PHGZT
PQGLB
M~E
7SC
7TB
7XB
8AL
8FD
8FK
FR3
JQ2
KR7
L7M
L~C
L~D
P62
PKEHL
PQEST
PQUKI
PRINS
Q9U
ID FETCH-LOGICAL-c427t-2f81c084cb9a384ccae6992bfed3a1a981395d00dfe61f8d0ce1dd61fef1472e3
IEDL.DBID DOA
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000985125900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2314-4629
IngestDate Tue Oct 14 19:08:45 EDT 2025
Fri Jul 25 11:54:14 EDT 2025
Wed Apr 02 17:06:33 EDT 2025
Mon Oct 20 16:52:12 EDT 2025
Sat Nov 29 06:09:58 EST 2025
Sun Jun 02 18:54:01 EDT 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
License This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c427t-2f81c084cb9a384ccae6992bfed3a1a981395d00dfe61f8d0ce1dd61fef1472e3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-5221-0574
0000-0002-4008-4873
0000-0001-8236-5756
0000-0002-9410-8834
0000-0002-3808-8592
0000-0001-5920-0726
OpenAccessLink https://doaj.org/article/da2daeca4ebb44f6ace4902552a74c54
PQID 2715341924
PQPubID 2037347
ParticipantIDs doaj_primary_oai_doaj_org_article_da2daeca4ebb44f6ace4902552a74c54
proquest_journals_2715341924
gale_infotracmisc_A833150593
gale_infotracacademiconefile_A833150593
crossref_primary_10_1155_2022_6194734
hindawi_primary_10_1155_2022_6194734
PublicationCentury 2000
PublicationDate 2022-00-00
PublicationDateYYYYMMDD 2022-01-01
PublicationDate_xml – year: 2022
  text: 2022-00-00
PublicationDecade 2020
PublicationPlace Cairo
PublicationPlace_xml – name: Cairo
PublicationTitle Journal of Mathematics
PublicationYear 2022
Publisher Hindawi
John Wiley & Sons, Inc
Wiley
Publisher_xml – name: Hindawi
– name: John Wiley & Sons, Inc
– name: Wiley
References e_1_2_8_16_2
e_1_2_8_17_2
e_1_2_8_19_2
e_1_2_8_13_2
West D. B. (e_1_2_8_1_2) 2001
e_1_2_8_15_2
Sudhahar P. A. P. (e_1_2_8_9_2) 2018; 13
e_1_2_8_2_2
e_1_2_8_4_2
e_1_2_8_3_2
e_1_2_8_6_2
e_1_2_8_5_2
Santhakumaran A. P. (e_1_2_8_8_2) 2014; 9
e_1_2_8_7_2
Ahangar H. A. (e_1_2_8_12_2) 2016; 100
Varghese E. S. (e_1_2_8_10_2) 2021; 12
Bermudo S. (e_1_2_8_14_2) 2010; 96
e_1_2_8_11_2
West D. B. (e_1_2_8_18_2) 2001
References_xml – volume-title: Introduction to Graph Theory
  year: 2001
  ident: e_1_2_8_18_2
– volume: 100
  start-page: 253
  year: 2016
  ident: e_1_2_8_12_2
  article-title: The total geodetic number of a graph
  publication-title: Utilitas Mathematica
– volume: 12
  start-page: 509
  year: 2021
  ident: e_1_2_8_10_2
  article-title: Strong open monophonic number of a graph
  publication-title: Communications in Mathematics and Applications
– ident: e_1_2_8_19_2
– ident: e_1_2_8_2_2
  doi: 10.1137/0211015
– ident: e_1_2_8_4_2
  doi: 10.12988/imf.2007.07153
– ident: e_1_2_8_6_2
  doi: 10.2298/fil1206081j
– ident: e_1_2_8_17_2
  doi: 10.1007/s40840-019-00833-6
– ident: e_1_2_8_11_2
  doi: 10.35940/ijeat.a1231.109119
– ident: e_1_2_8_16_2
  doi: 10.5539/jmr.v11n2p20
– volume: 9
  year: 2014
  ident: e_1_2_8_8_2
  article-title: The total open monophonic number of a graph
  publication-title: Journal of Advances in Mathematics
– volume-title: Introduction to Graph Theory
  year: 2001
  ident: e_1_2_8_1_2
– ident: e_1_2_8_15_2
  doi: 10.1016/j.disc.2009.09.018
– volume: 13
  year: 2018
  ident: e_1_2_8_9_2
  article-title: The connected total monophonic domination number of a graph
  publication-title: International Journal of Applied Engineering Research
– ident: e_1_2_8_3_2
  doi: 10.1016/0895-7177(93)90259-2
– volume: 96
  start-page: 469
  year: 2010
  ident: e_1_2_8_14_2
  article-title: On geodetic and k-geodetic sets in graphs
  publication-title: Ars Combinatoria-Waterloo then Winnipeg
– ident: e_1_2_8_5_2
  doi: 10.7151/dmgt.2139
– ident: e_1_2_8_7_2
  doi: 10.1016/j.disc.2006.08.002
– ident: e_1_2_8_13_2
  doi: 10.1016/j.dam.2009.11.016
SSID ssj0001283890
ssib026596782
ssib050733809
Score 2.1679044
Snippet 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...
Let G be a graph with vertex set as V ( G ) and edge set as E ( G ) which is simple as well as connected. The problem of strong total monophonic set is to find...
Let G be a graph with vertex set as V(G) and edge set as E(G) which is simple as well as connected. The problem of strong total monophonic set is to find the...
SourceID doaj
proquest
gale
crossref
hindawi
SourceType Open Website
Aggregation Database
Index Database
Publisher
SubjectTerms Apexes
Graphs
Mathematics
Police
Vertex sets
SummonAdditionalLinks – databaseName: Hindawi Publishing Open Access
  dbid: RHX
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Lb9QwELbaqkhwqCgPsXSLfCjiQkTiR2IfC2ppD11VpUh7wnL8KHvJok1a1H_fmcRZsfQApziJZVnz8IzH428IObLMq0pHlnHveSaEiJnCi8Cx1FpE572uXV9soprN1HyuLxNIUvv4CB-sHW7P2SfcbFdcbJNtJTFz6-psPooNK6Uu_wBll1iHcESlGkItCsxy3peZK0QmSqbHFPi_ht8wTj2G_3qlfvIT98i_F4_W7N4QnT4ne8mDpMcDy_fJVmhekGcXa_jV9iX58Q0D3Df0egmuNQW1XWIG-sLRy6F8TEsXDbYR65V-Rcjq9iOdDQnh0LKNp-ddS4eKDyla2L8hemZ3_4p8Pz25_nKWpUIKmROs6jIWVeFyJVytLYeHswFYweoYPLeF1QrcQOnz3MdQFlH53IXCe2iGWIiKBf6a7DTLJrwh1EFXcOoYODZMBKuUD6VnzHrFClvVekLejxQ0vwa8DNPvM6Q0SGmTKD0hn5G86z6Ict1_AM6bpDTGgyTZ4KwIdQ1SVFoXBB6LSmYr4SQM8gGZY1AXu5V1Nl0pgKkiqpU5VpyDwys1n5DpRk_QIbfx-yix9x-Tno68N0nVW8MqMBp4li7e_t8oB-Qpvg5xnCnZ6Va34ZDsurtu0a7e9aL9AC_B7VY
  priority: 102
  providerName: Hindawi Publishing
– databaseName: Engineering Database
  dbid: M7S
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwELaggAQH3oiFBflQxIWoiR-JfUIFUeDAqlKL1BOW40e7l6RsAoh_z4zjLFohwYFTnNiyEs3D4_Hk-wjZt8yrRkdWcO95IYSIhcIfgWOttYjOe926RDbRrFbq7Ewf54TbkMsqZ5-YHLXvHebID1gDtolHluL15dcCWaPwdDVTaFwl1xAloUqleyezPkkkJJzhqaaci4L1uUx8c5UoRM30XAsvJaYB2AFu6hsudlapBOa_ddk3LnCz_GP9h_NOK9LRnf_9lrvkdo5F6eGkPPfIldDdJ7c-bYFchwfkywmmys_paQ9BOgUH0GMt-9rR44mIZqDrDtuIGkvfI_j18IquptJyaNnO04_jQCfuiJx3THeIwzn-fEg-H707ffuhyJQMhROsGQsWVeVKJVyrLYeLswGEytoYPLeV1QoCSunL0sdQV1H50oXKe2iGWImGBf6I7HV9Fx4T6mAohIcMQiQmglXKh9ozZr1ilW1avSAvZhGYywl5w6Qdi5QGRWWyqBbkDcpnOwbxstODfnNusvkZDzppg7MitC3oY21dEHjAKplthJMwyUuUrkGrHjfW2fxzArwq4mOZQ8U5hM5S8wVZ7owEa3Q73ftZP_7x0stZM0x2GoP5rRZP_t79lNzEyaZM0JLsjZtv4Rm57r6P62HzPNnALw4gCo0
  priority: 102
  providerName: ProQuest
Title Strong Total Monophonic Problems in Product Graphs, Networks, and Its Computational Complexity
URI https://dx.doi.org/10.1155/2022/6194734
https://www.proquest.com/docview/2715341924
https://doaj.org/article/da2daeca4ebb44f6ace4902552a74c54
Volume 2022
WOSCitedRecordID wos000985125900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2314-4785
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001283890
  issn: 2314-4629
  databaseCode: DOA
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2314-4785
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib050733809
  issn: 2314-4629
  databaseCode: M~E
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 2314-4785
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001283890
  issn: 2314-4629
  databaseCode: K7-
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 2314-4785
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001283890
  issn: 2314-4629
  databaseCode: M7S
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 2314-4785
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001283890
  issn: 2314-4629
  databaseCode: BENPR
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 2314-4785
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001283890
  issn: 2314-4629
  databaseCode: PIMPY
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
– providerCode: PRVWIB
  databaseName: Wiley Online Library Open Access
  customDbUrl:
  eissn: 2314-4785
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001283890
  issn: 2314-4629
  databaseCode: 24P
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://authorservices.wiley.com/open-science/open-access/browse-journals.html
  providerName: Wiley-Blackwell
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lb9QwELZQAQkOiKfYsqx8KOJC1MR21vaxRVtaoa6itkjLBcvxo-wlizYpiAu_nZk4u-qKQy9cEju2HGcm9szY428IObDMK6kjy7j3PBNCxEzhQeA41VpE572uXR9sQs7narHQ1a1QX-gTluCBE-EOPbRmg7Mi1DW0NLUuCNwaK5mVwpU9Emgu9S1jKq2uKJDE-cbTvSzRyGeHaLJLLnZkUA_Vv52QH35HU_jX8p-puZc3J0_Jk0FRpEepg8_IvdA8J4_Ptyir7Qvy7RLXsa_p1Qo0aAqjc4WO5ktHqxQlpqXLBtMI6Uo_ITJ1-4HOk983pGzj6VnX0hTYYVgU7HMIktn9fkm-nMyuPp5mQ7yEzAkmu4xFVbhcCVdry-HmbACKszoGz21htQJtr_R57mOYFlH53IXCe0iGWAjJAn9F9ppVE14T6qAq6G4M9BcmglXKh6lnzHrFCitrPSLvNhQ0PxIshunNibI0SGkzUHpEjpG82zoIZt0_ABabgcXmLhaPyHtkjsEh162ts8PJAegqgleZI8U56LWl5iMy3qkJQ8XtFB8M7L2j0-MN780wolvDJMgG3DIX-__jm96QR_jKtJgzJnvd-ia8JQ_cz27Zrifk_vFsXl1M-p8arp9lNkGv1Eu8_plBeXV2Xn2F3MXp4i_-4v_U
linkProvider Directory of Open Access Journals
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwELZKAQEH3oiFBXxoxYWoie3E9gGh8ihdbbuqxCL1VOPYTtlLUjaBqn-K38hMHotWSHDqgVOc2LKc5JvxzNiej5Aty7ySumAR955HQogiUngQuMi0FoXzXueuJZuQs5k6PtZHG-TncBYGt1UOOrFV1L5yGCPfYRJkE5csxZuzbxGyRuHq6kCh0cFiGi7OwWWrX0_ew__dZmzvw_zdftSzCkROMNlErFCJi5VwubYcLs4GGBfLi-C5TaxWYBOlPo59EbKkUD52IfEeiqFIhGSBQ79XyFXBlUS5mspowG-KBIhDOqwuxqPAHohbfrtERCJjeth7n6YYdmA7GESQXKzNii15wGqKuP4VnfPzxR-TRTsD7t35377dXXK7t7Xpbicc98hGKO-TW4erRLX1A3LyCZcCTum8AieEgoKrcK_-wtGjjminposSy5gVl37E5N71Kzrrts5DyZaeTpqadtwYfVy1vcM8o83FQ_L5Ul7wEdksqzI8JtRBUzB_GZiATASrlA-ZZ8x6xRIrcz0i28MvN2ddZhHTemRpahAapofGiLxFPKzaYD7w9kG1PDW9ejEeZM4GZ0XIc5C3zLogcAE5ZVYKl0InLxFNBrVWs7TO9ocvYKiY_8vsKs7BNUg1H5HxWkvQNm6teqvH4z8GPR6QaHqlWJvfMHzy9-oX5Mb-_PDAHExm06fkJnbcRb3GZLNZfg_PyDX3o1nUy-et_FHy5bJB-wv7R2m7
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwELbKFhAceCMWFvChFReiTRwncQ4IFcrCqnQViSKVC8bxo-wlKZtA1b_Gr2MmcRatkODUA6c4G8tyNt-MZ8bj-QjZUcyILHcsiI2JA865CwQeBHZpnnOnjclL3ZFNZIuFOD7Oiy3yczgLg2mVg07sFLWpNcbIpywD2cQtSz51Pi2i2J-9PP0WIIMU7rQOdBo9RA7s-Rm4b82L-T58613GZm-OXr8LPMNAoDnL2oA5EelQcF3mKoaLVhbmyEpnTawilQuwjxIThsbZNHLChNpGxkDTuohnzMYw7iWyDSY5ZyOyXcwPi08DmhOkQxyKY_URHwHWQdix3UU84CnLh0z8JMEgBJtiSCGL-cYa2VEJrBeMK1_RVT9b_rF0dOvh7Ob__E_eIje8FU73erG5TbZsdYdcP1yXsG3uks8fcJPghB7V4J5QUH01ZvEvNS16Cp6GLitsY71c-hbLfjfP6aJPqoeWqgydtw3tWTN8xLW7wwqk7fk98vFCXvA-GVV1ZR8QqqErGMYMjEPGrRLC2NQwpoxgkcrKfEx2h88vT_uaI7Lz1ZJEIkykh8mYvEJsrPtgpfDuh3p1Ir3ikQakUVmtuC1LkMRUactxazlhKuM6gUGeIbIk6rN2pbTyxzJgqlgZTO6JOAanIcnjMZls9AQ9pDce73hs_mPSkwGV0qvLRv6G5MO_P35KrgJW5fv54uARuYbj9uGwCRm1q-_2Mbmsf7TLZvXECyMlXy4atb8Aitx0PA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Strong+Total+Monophonic+Problems+in+Product+Graphs%2C+Networks%2C+and+Its+Computational+Complexity&rft.jtitle=Journal+of+mathematics+%28Hidawi%29&rft.au=Eddith+Sarah+Varghese&rft.au=D.+Antony+Xavier&rft.au=Ammar+Alsinai&rft.au=Deepa+Mathew&rft.date=2022&rft.pub=Wiley&rft.eissn=2314-4785&rft.volume=2022&rft_id=info:doi/10.1155%2F2022%2F6194734&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_da2daeca4ebb44f6ace4902552a74c54
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2314-4629&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2314-4629&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2314-4629&client=summon