Connected triangle-free planar graphs whose second largest eigenvalue is at most 1

DOI10.1007/S40314-024-03027-4MaRDI QIDQ7033357zbMATH OpenFDO

Authors Kun Cheng, Shuchao Li

Publication date 3 February 2025

Published in Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40314-024-03027-4

zbMATH Keywords

forbidden induced subgraphgraph spectrumplanar graphsecond largest eigenvalue

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Cites work

• Biregular graphs with three eigenvalues
• Characterization of outerplanar graphs whose second largest eigenvalue is at most 1
• Connected \((K_4 - e)\)-free graphs whose second largest eigenvalue does not exceed 1
• Equiangular lines with a fixed angle
• Generalized line graphs with the second largest eigenvalue at most 1
• Graph theory
• Graphs characterized by the second eigenvalue
• Graphs with three eigenvalues and second largest eigenvalue at most 1
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3825855 (Why is no real title available?)
• Inequalities for Graph Eigenvalues
• Multiplicity of  the second‐largest eigenvalue of a planar graph
• On bicyclic graphs whose second largest eigenvalue does not exceed 1
• On generalized -graphs whose second largest eigenvalue does not exceed 1
• On graphs whose second largest eigenvalue equals 1 -- the star complement technique
• On graphs whose second largest eigenvalue is at most 1
• On graphs whose second largest eigenvalue is less than 1
• On graphs with exactly one eigenvalue less than -1
• 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 second largest eigenvalue of line graphs
• On tricyclic graphs whose second largest eigenvalue does not exceed 1
• On unicyclic graphs whose second largest eigenvalue does not exceed 1
• Spectra of graphs
• Spectral characterization of the complete graph removing a cycle
• The \(T_{1,2}\)-free planar graphs whose second largest eigenvalue does not exceed 1
• The 2-partially distance-regular graphs such that their second largest local eigenvalues are at most one
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• The second largest eigenvalue of a tree

Cited in

(1)

• On K₄-minor free graphs whose second largest eigenvalue does not exceed 1

This page was built for publication: Connected triangle-free planar graphs whose second largest eigenvalue is at most 1

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7033357)