L-RCM: a method to detect connected components in undirected graphs by using the Laplacian matrix and the RCM algorithm

Francisco Pedroche, Miguel Rebollo, Carlos Carrascosa +1

In this paper we consider undirected graphs with no loops and multiple edges, consisting of k connected components. In these cases, it is well known that one can find a numbering o…