Bicyclic graphs with exactly two main signless Laplacian eigenvalues
classification
🧮 math.CO
keywords
laplacianmainsignlessbicycliceigenvalueeigenvaluesexactlygraphs
read the original abstract
A signless Laplacian eigenvalue of a graph $G$ is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, all connected bicyclic graphs with exactly two main eigenvalues are determined.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.