A linear algorithm for obtaining the Laplacian eigenvalues of a cograph
From MaRDI portal
Abstract: In this paper, we give a linear algorithm for obtaining the Laplacian eigenvalues of a cograph. This approach is more efficient as there is no need of computing the eigenvalues of matrix Laplacian related to this class of graph. As an application, we use this algorithm as a tool for obtaining a closed formula for the number of spanning trees of a cograph.
This page was built for publication: A linear algorithm for obtaining the Laplacian eigenvalues of a cograph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6510628)
