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

Minimum Partition of an r−Independence System

Author

Listed:
  • Zill-e-Shams
  • Muhammad Salman
  • Zafar Ullah
  • Usman Ali
  • Ali Ahmad

Abstract

Graph partitioning has been studied in the discipline between computer science and applied mathematics. It is a technique to distribute the whole graph data as a disjoint subset to a different device. The minimum graph partition problem with respect to an independence system of a graph has been studied in this paper. The considered independence system consists of one of the independent sets defined by Boutin. We solve the minimum partition problem in path graphs, cycle graphs, and wheel graphs. We supply a relation of twin vertices of a graph with its independence system. We see that a maximal independent set is not always a minimal set in some situations. We also provide realizations about the maximum cardinality of a minimum partition of the independence system. Furthermore, we study the comparison of the metric dimension problem of a graph with the minimum partition problem of that graph.

Suggested Citation

  • Zill-e-Shams & Muhammad Salman & Zafar Ullah & Usman Ali & Ali Ahmad, 2021. "Minimum Partition of an r−Independence System," Journal of Mathematics, Hindawi, vol. 2021, pages 1-10, August.
    • Handle: RePEc:hin:jjmath:7163840
    DOI: 10.1155/2021/7163840
    as

    Download full text from publisher

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