Mathematical model and algorithm addresses the connected vertex separator in power graphs, indicating substantial efficiency.
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.
No takes yet. Share an insight, caveat, or question.
Althoby et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: