On some algorithmic investigations of star partitions of graphs

Abstract

Star partitions of graphs were introduced in a recent paper by the same authors in order to extend spectral methods in algebraic graph theory. Here it is shown that the corresponding partitioning problem is polynomial. Two algorithms are investigated: the first is based on the maximum matching problem for graphs, and the second invokes an algorithm for matroid intersection.