Combinatorial upper bounds for the smallest eigenvalue of a graph

DOI10.1007/S00013-024-01998-8zbMATH Open1546.05084MaRDI QIDQ6564137FDOQ6564137

Dariush Kiani, Aryan Esmailpour, Sara Saeedi Madani

Publication date: 28 June 2024

Published in: Archiv der Mathematik (Search for Journal in Brave)

zbMATH Keywords

chromatic numberaverage degreeindependence numbergraph eigenvalues

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Spectra of graphs
• Optimization, approximation, and complexity classes
• K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
• Graphs for which the least eigenvalue is minimal. I
• Max \(k\)-cut and the smallest eigenvalue
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Max Cut and the Smallest Eigenvalue
• Graphs for which the least eigenvalue is minimal. II.
• Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable
• The spectral radius and the maximum degree of irregular graphs
• Bipartite Subgraphs and the Smallest Eigenvalue
• The spectral radius of subgraphs of regular graphs
• Some observations on the smallest adjacency eigenvalue of a graph
• The smallest eigenvalue of \(K_{r}\)-free graphs
• The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters
• Dense induced bipartite subgraphs in triangle-free graphs
• Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph

This page was built for publication: Combinatorial upper bounds for the smallest eigenvalue of a graph

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