Eigenvalues and forbidden subgraphs. I.

DOI10.1016/J.LAA.2006.10.007zbMATH Open1114.05063arXivmath/0608329OpenAlexW2112066026MaRDI QIDQ869937FDOQ869937

Authors: Vladimir Nikiforov 

Publication date: 9 March 2007

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: We present sharp inequalities relating the number of vertices, edges, and triangles of a graph to the smallest eigenvalue of its adjacency matrix and the largest eigenvalue of its Laplacian.

Full work available at URL: https://arxiv.org/abs/math/0608329

Recommendations

• Eigenvalues and triangles in graphs
• Some Inequalities for the Largest Eigenvalue of a Graph
• Some bounds on the largest eigenvalues of graphs
• Graphs and Hermitian matrices: eigenvalue interlacing
• Bounds on graph eigenvalues. II

zbMATH Keywords

largest eigenvaluesmallest eigenvaluegraph Laplacian\(K_{r}\)-free graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On maximal paths and circuits of graphs
• Title not available (Why is that?)
• Graphs and Hermitian matrices: eigenvalue interlacing
• The smallest eigenvalue of \(K_{r}\)-free graphs
• On the extreme eigenvalues of regular graphs.

Cited In (8)

• Eigenvalues and triangles in graphs
• The relation between eigenvalue and Laplacian degree of complete tripartite hypergraphs
• A Forbidden Set for Embedded Eigenvalues
• New results for MaxCut in H$H$‐free graphs
• Note on the sum of the smallest and largest eigenvalues of a triangle-free graph
• New analytical lower bounds on the clique number of a graph
• The smallest eigenvalue of \(K_{r}\)-free graphs
• Bounds on graph eigenvalues. II

This page was built for publication: Eigenvalues and forbidden subgraphs. I.

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