IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i18p2970-d1749114.html
   My bibliography  Save this article

A Vertex Separator Problem for Power Graphs of Groups

Author

Listed:
  • Haeder Younis Althoby

    (Department of Mathematics, College of Science, University of Al Qadisiyah, Diwaniyah 58001, Iraq)

  • Mohammed A. Mutar

    (Department of Mathematics, College of Science, University of Al Qadisiyah, Diwaniyah 58001, Iraq)

  • Daniele Ettore Otera

    (Institute of Data Science and Digital Technologies, Faculty of Mathematics and Informatics, Vilnius University, 08412 Vilnius, Lithuania)

Abstract

Given a graph G , an st-connected vertex separator (CVS) problem refers to the search for a minimum connected component in G whose removal leaves the pair of nodes s and t in two disjoint components. We investigate this specific problem on certain types of graphs—so-called power graphs associated with groups. We present a mathematical model and an algorithm to solve this problem in a reasonable time. Finally, numerical tests show that the algorithm runs considerably fast even on graphs of high orders.

Suggested Citation

  • Haeder Younis Althoby & Mohammed A. Mutar & Daniele Ettore Otera, 2025. "A Vertex Separator Problem for Power Graphs of Groups," Mathematics, MDPI, vol. 13(18), pages 1-11, September.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:18:p:2970-:d:1749114
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/18/2970/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/18/2970/
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;

    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:gam:jmathe:v:13:y:2025:i:18:p:2970-:d:1749114. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.