Proof of a conjecture of V. Nikiforov

DOI10.1007/s00493-011-2652-1zbMath1261.05046OpenAlexW2078930888WikidataQ122889851 ScholiaQ122889851MaRDI QIDQ2428640

Tamás Terpai

Publication date: 26 April 2012

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-011-2652-1

zbMATH Keywords

simple graphseigenvalue of adjacency matrix

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (05C99)

Related Items (13)

A note on the Nordhaus-Gaddum type inequality to the second largest eigenvalue of a graph ⋮ Maximum norms of graphs and matrices, and their complements ⋮ Nordhaus-Gaddum type inequalities of the second \(A_\alpha\)-eigenvalue of a graph ⋮ Maximum spread of graphs and bipartite graphs ⋮ Nordhaus-Gaddum type inequalities for Laplacian and signless Laplacian eigenvalues ⋮ Generalizations of some Nordhaus–Gaddum‐type results on spectral radius ⋮ Graph Limits and Spectral Extremal Problems for Graphs ⋮ Nordhaus-Gaddum type inequalities for the \(k\)th largest Laplacian eigenvalues ⋮ More eigenvalue problems of Nordhaus-Gaddum type ⋮ Extrema of graph eigenvalues ⋮ Nordhaus-Gaddum and other bounds for the sum of squares of the positive eigenvalues of a graph ⋮ Signless Laplacian eigenvalue problems of Nordhaus-Gaddum type ⋮ The Nordhaus-Gaddum type inequalities of \(A_\alpha \)-matrix

Cites Work

• Unnamed Item
• Eigenvalue problems of Nordhaus--Gaddum type
• Szemerédi's lemma for the analyst
• On a conjecture of V. Nikiforov

This page was built for publication: Proof of a conjecture of V. Nikiforov