A linear algorithm for obtaining the Laplacian eigenvalues of a cograph

In this article, we give an time and space algorithm for obtaining the Laplacian eigenvalues of a cograph. This approach is more efficient as there is no need to directly compute the eigenvalues of Laplacian matrix related to this class of graphs. As an application, we use this algorithm as a tool f...

Full description

Saved in:

Bibliographic Details
Published in:	Special matrices Vol. 12; no. 1; pp. 68 - 81
Main Authors:	Chen, Guantao, Tura, Fernando C.
Format:	Journal Article
Language:	English
Published:	De Gruyter 06-09-2024
Subjects:	05C50 05C85 15A18 cograph Laplacian eigenvalues spanning trees
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	In this article, we give an time and space algorithm for obtaining the Laplacian eigenvalues of a cograph. This approach is more efficient as there is no need to directly compute the eigenvalues of Laplacian matrix related to this class of graphs. As an application, we use this algorithm as a tool for obtaining a closed formula for the number of spanning trees of a cograph.
ISSN:	2300-7451 2300-7451
DOI:	10.1515/spma-2024-0024