A Vertex Separator Problem for Power Graphs of Groups

Haeder Younis Althoby, Mohammed A. Mutar and Daniele Ettore Otera ()
Additional contact information
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

Mathematics, 2025, vol. 13, issue 18, 1-11

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.

Keywords: vertex separator; st-connected separator; power graph (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/13/18/2970/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/18/2970/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:18:p:2970-:d:1749114

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().