On a conjecture of V. Nikiforov
From MaRDI portal
Publication:1043985
DOI10.1016/j.disc.2009.02.013zbMath1194.05084OpenAlexW2055580428WikidataQ123264993 ScholiaQ123264993MaRDI QIDQ1043985
Publication date: 10 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.02.013
Related Items (36)
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 ⋮ On sufficient spectral radius conditions for Hamiltonicity ⋮ Extremal graphs for the Tutte polynomial ⋮ Some bounds for total communicability of graphs ⋮ Eigenvalue monotonicity of \(q\)-Laplacians of trees along a poset ⋮ Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles ⋮ Nordhaus-Gaddum type inequalities for Laplacian and signless Laplacian eigenvalues ⋮ Spectral radius and rainbow matchings of graphs ⋮ Dr. Charles L. Suffel: Scholar, teacher, mentor, friend ⋮ Generalizations of some Nordhaus–Gaddum‐type results on spectral radius ⋮ The maximum spectral radius of graphs without spanning linear forests ⋮ Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian ⋮ Complete signed graphs with largest maximum or smallest minimum eigenvalue ⋮ Proof of a conjecture of V. Nikiforov ⋮ Graph Limits and Spectral Extremal Problems for Graphs ⋮ Nordhaus-Gaddum type inequalities for the \(k\)th largest Laplacian eigenvalues ⋮ Stability of Woodall's theorem and spectral conditions for large cycles ⋮ Spectral radius and Hamiltonian properties of graphs, II ⋮ More eigenvalue problems of Nordhaus-Gaddum type ⋮ Graph vulnerability parameters, compression, and threshold graphs ⋮ Unified spectral Hamiltonian results of balanced bipartite graphs and complementary graphs ⋮ Graph vulnerability parameters, compression, and quasi-threshold graphs ⋮ Extrema of graph eigenvalues ⋮ The number of edges, spectral radius and Hamilton-connectedness of graphs ⋮ Spectral results on Hamiltonian problem ⋮ Spectral analogues of Erdős' theorem on Hamilton-connected graphs ⋮ 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 ⋮ Open problems on graph eigenvalues studied with AutoGraphiX ⋮ Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphs ⋮ Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius ⋮ Solution to a conjecture on the maximum skew-spectral radius of odd-cycle graphs ⋮ Spectral and extremal conditions for supereulerian graphs ⋮ Spectral condition for Hamiltonicity of a graph
Cites Work
- Eigenvalue problems of Nordhaus--Gaddum type
- On the spectral radius of (0,1)-matrices
- On the maximal index of graphs with a prescribed number of edges
- Linear combinations of graph eigenvalues
- On graphs with randomly deleted edges
- A reliability-improving graph transformation with applications to network reliability
- Network transformations and bounding network reliability
This page was built for publication: On a conjecture of V. Nikiforov
