IDEAS home Printed from https://ideas.repec.org/a/wsi/nmncxx/v20y2024i01ns1793005724500108.html
   My bibliography  Save this article

Connectedness in Soft Semigraphs

Author

Listed:
  • Bobin George

    (Department of Mathematics, Pavanatma College, Murickassery, India)

  • Jinta Jose

    (Department of Science and Humanities, Viswajyothi College of Engineering and Technology, Vazhakulam, India)

  • Rajesh K. Thumbakara

    (Department of Mathematics, Mar Athanasius College (Autonomous), Kothamangalam, India)

Abstract

Soft set theory is a general mathematical method for dealing with uncertain data. It is a classification of elements of the universe with respect to some given set of parameters. Semigraph is a generalization of graph which is different from hypergraph. Soft semigraph was introduced by applying the concept of soft set in semigraph. Connectedness is one of the basic concepts of graph theory. In this paper, we introduce the concepts of s-walk, s-trail, s-path and s-cycle in soft semigraphs and we define an s-connected soft semigraph. We explain the procedures of vertex and fp-edge deletions from a soft semigraph. Also, we introduce p-part cut vertex, s-cut vertex, p-part bridge and s-bridge of a soft semigraph and investigate some of their properties.

Suggested Citation

  • Bobin George & Jinta Jose & Rajesh K. Thumbakara, 2024. "Connectedness in Soft Semigraphs," New Mathematics and Natural Computation (NMNC), World Scientific Publishing Co. Pte. Ltd., vol. 20(01), pages 157-182, March.
    • Handle: RePEc:wsi:nmncxx:v:20:y:2024:i:01:n:s1793005724500108
    DOI: 10.1142/S1793005724500108
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S1793005724500108
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S1793005724500108?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Keywords

    Semigraph; soft semigraph;

    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:wsi:nmncxx:v:20:y:2024:i:01:n:s1793005724500108. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/nmnc/nmnc.shtml .

    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.