| Title |
A vertex separator problem for power graphs of groups |
| Authors |
Althoby, Haeder Younis ; Mutar, Mohammed ; Otera, Daniele Ettore |
| DOI |
10.3390/math13182970 |
| Full Text |
|
| Is Part of |
Mathematics.. Basel : MDPI. 2025, vol. 13, iss. 18, art. no. 2970, p. 1-11.. eISSN 2227-7390 |
| Keywords [eng] |
vertex separator ; st-connected separator ; power graph |
| Abstract [eng] |
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. |
| Published |
Basel : MDPI |
| Type |
Journal article |
| Language |
English |
| Publication date |
2025 |
| CC license |
|
