Laplacian eigenvalues and eigenspaces of cographs generated by finite sequence
From MaRDI portal
Publication:6435649
arXiv2305.04252MaRDI QIDQ6435649FDOQ6435649
Authors: Santanu Mandal, Ranjit Mehatari, Zoran Stanić 
Publication date: 7 May 2023
Abstract: All graphs in this study are assumed to be undirected, simple and connected. It is possible to associate a creation sequence for a certain class of cographs. The primary goal of this work is to investigate the Laplacian spectrum, various connectivity parameters with extremal property, and clique number of those cographs under assumption. It is shown that Laplacian matrix of such cograph has exactly one main eigenvalue. We obtain the clique number of these graphs. Finally, we make an attempt to find a connection between algebraic connectivity and clique number.
This page was built for publication: Laplacian eigenvalues and eigenspaces of cographs generated by finite sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6435649)
