On tricyclic graphs whose second largest eigenvalue does not exceed 1
From MaRDI portal
(Redirected from Publication:632473)
Recommendations
- On bicyclic graphs whose second largest eigenvalue does not exceed 1
- On graphs whose second largest eigenvalue is at most 1
- On graphs whose second largest eigenvalue is less than 1
- scientific article; zbMATH DE number 672350
- On unicyclic graphs whose second largest eigenvalue does not exceed 1
- On graphs with second largest eigenvalue less than 1
- Graphs with three eigenvalues and second largest eigenvalue at most 1
- Some graphs whose second largest eigenvalue does not exceed \(\sqrt 2\)
- On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\)
- On generalized \(\theta \)-graphs whose second largest eigenvalue does not exceed 1
Cites work
- scientific article; zbMATH DE number 3825855 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 5259335 (Why is no real title available?)
- On bicyclic graphs whose second largest eigenvalue does not exceed 1
- On generalized \(\theta \)-graphs whose second largest eigenvalue does not exceed 1
- On graphs whose second largest eigenvalue equals 1 -- the star complement technique
- On graphs with unicyclic star complement for 1 as the second largest eigenvalue
- On nested split graphs whose second largest eigenvalue is less than 1
- On regular graphs and coronas whose second largest eigenvalue does not exceed 1
- On the index of tricyclic graphs with perfect matchings
- On tricyclic graphs of a given diameter with minimal energy
- On unicyclic graphs whose second largest eigenvalue does not exceed 1
- Sharp lower bounds on the eigenvalues of trees
- The Laplacian spectral radius of tricyclic graphs with \(n\) vertices and \(k\) pendant vertices
- The Laplacian spread of tricyclic graphs
- The spectral radius of tricyclic graphs with \(n\) vertices and \(k\) pendent vertices
Cited in
(12)- On unicyclic graphs whose second largest eigenvalue does not exceed 1
- Proof of a conjecture involving the second largest \(D\)-eigenvalue and the number of triangles
- The complete classification of graphs whose second largest eigenvalue of the eccentricity matrix is less than 1
- A note on the Nordhaus-Gaddum type inequality to the second largest eigenvalue of a graph
- Graphs with second largest eigenvalue less than 1/2
- Spectral characterization of unicyclic graphs whose second largest eigenvalue does not exceed 1
- On bicyclic graphs whose second largest eigenvalue does not exceed 1
- The \(T_{1,2}\)-free planar graphs whose second largest eigenvalue does not exceed 1
- Tricyclic graph whose least eigenvalue is minimum
- Tricyclic and tetracyclic graphs with maximum and minimum eccentric connectivity
- Planar graphs whose second largest eigenvalue smaller than \(\frac{\sqrt{5}-1}{2}\)
- Graphs with three eigenvalues and second largest eigenvalue at most 1
This page was built for publication: On tricyclic graphs whose second largest eigenvalue does not exceed 1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632473)