IDEAS home Printed from https://ideas.repec.org/a/hin/jjmath/6194734.html
   My bibliography  Save this article

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

Author

Listed:
  • Eddith Sarah Varghese
  • D. Antony Xavier
  • Ammar Alsinai
  • Deepa Mathew
  • S. Arul Amirtha Raja
  • Hanan Ahmed
  • Akbar Ali

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.

Suggested Citation

  • Eddith Sarah Varghese & D. Antony Xavier & Ammar Alsinai & Deepa Mathew & S. Arul Amirtha Raja & Hanan Ahmed & Akbar Ali, 2022. "Strong Total Monophonic Problems in Product Graphs, Networks, and Its Computational Complexity," Journal of Mathematics, Hindawi, vol. 2022, pages 1-7, September.
    • Handle: RePEc:hin:jjmath:6194734
    DOI: 10.1155/2022/6194734
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/jmath/2022/6194734.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/jmath/2022/6194734.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2022/6194734?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jjmath:6194734. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.