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

Graphical Analysis of Covering and Paired Domination in the Environment of Neutrosophic Information

Author

Listed:
  • Sami Ullah Khan
  • Abdul Nasir
  • Naeem Jan
  • Zhen-Hua Ma

Abstract

Neutrosophic graph (NG) is a powerful tool in graph theory, which is capable of modeling many real-life problems with uncertainty due to unclear, varying, and indeterminate information. Meanwhile, the fuzzy graphs (FGs) and intuitionistic fuzzy graphs (IFGs) may not handle these problems as efficiently as NGs. It is difficult to model uncertainty due to imprecise information and vagueness in real-world scenarios. Many real-life optimization problems are modeled and solved using the well-known fuzzy graph theory. The concepts of covering, matching, and paired domination play a major role in theoretical and applied neutrosophic environments of graph theory. Henceforth, the current study covers this void by introducing the notions of covering, matching, and paired domination in single-valued neutrosophic graph (SVNG) using the strong edges. Also, many attention-grabbing properties of these concepts are studied. Moreover, the strong covering number, strong matching number, and the strong paired domination number of complete SVNG, complete single-valued neutrosophic cycle (SVNC), and complete bipartite SVNG are worked out along with their fascinating properties.

Suggested Citation

  • Sami Ullah Khan & Abdul Nasir & Naeem Jan & Zhen-Hua Ma, 2021. "Graphical Analysis of Covering and Paired Domination in the Environment of Neutrosophic Information," Mathematical Problems in Engineering, Hindawi, vol. 2021, pages 1-12, April.
    • Handle: RePEc:hin:jnlmpe:5518295
    DOI: 10.1155/2021/5518295
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2021/5518295.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2021/5518295.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2021/5518295?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:jnlmpe:5518295. 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.