Some Inequalities for the Largest Eigenvalue of a Graph
From MaRDI portal
Publication:3147278
DOI10.1017/S0963548301004928zbMath1005.05029OpenAlexW1984835757MaRDI QIDQ3147278
Publication date: 11 February 2003
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548301004928
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (only showing first 100 items - show all)
On the first two eigenvalues of regular graphs ⋮ Maximum degree and spectral radius of graphs in terms of size ⋮ Remarks on the largest eigenvalue of a signed graph ⋮ On the sum of the k largest absolute values of Laplacian eigenvalues of digraphs ⋮ Spectral radius of graphs forbidden \(C_7\) or \(C_6^\triangle \) ⋮ Extremal results for \(C_3^-\)-free signed graphs ⋮ A spectral extremal problem on non-bipartite triangle-free graphs ⋮ Spectral radius of graphs with given size and odd girth ⋮ Binding number, \(k\)-factor and spectral radius of graphs ⋮ Spectral extremal graphs for intersecting cliques ⋮ Improved sufficient conditions for \(k\)-leaf-connected graphs ⋮ An improvement of spectral conditions for Hamilton-connected graphs ⋮ Signless Laplacian spectral radius of graphs without short cycles or long cycles ⋮ Spectral characterization of multicone graphs ⋮ Conjectured bounds for the sum of squares of positive eigenvalues of a graph ⋮ Trees with small spectral gap ⋮ A generalization of a Turán’s theorem about maximum clique on graphs ⋮ The spectral radius of graphs with no intersecting odd cycles ⋮ The signless Laplacian spectral radius of \(k\)-connected irregular graphs ⋮ Extremal digraphs with given clique number ⋮ Numerical radius and zero pattern of matrices ⋮ Walks and the spectral radius of graphs ⋮ Cliques and the spectral radius ⋮ On the spectral characterization of Kite graphs ⋮ Bounds on graph eigenvalues. I ⋮ Three conjectures in extremal spectral graph theory ⋮ Sharp upper bounds on the \(Q\)-index of (minimally) 2-connected graphs with given size ⋮ Eigenvalue problems of Nordhaus--Gaddum type ⋮ Ordering the maxima of \(L\)-index and \(Q\)-index: graphs with given size and diameter ⋮ A note on eigenvalues of signed graphs ⋮ On sufficient spectral radius conditions for Hamiltonicity ⋮ A sharp upper bound on the spectral radius of \(C_5\)-free/\(C_6\)-free graphs with given size ⋮ New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix ⋮ On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees ⋮ On the spectral radius of minimally 2-(edge)-connected graphs with given size ⋮ The maximum spectral radius of \(\{C_3, C_5\}\)-free graphs of given size ⋮ Spectral radius conditions for the rigidity of graphs ⋮ On the \(A_\alpha \)-spectral radius of graphs with given size ⋮ On a generalization of the spectral Mantel's theorem ⋮ Spectral extremal graphs for the bowtie ⋮ Maxima of the \(Q\)-spectral radius of \(C_3 (C_4)\)-free graphs with given size and minimum degree \(\delta \geq 2\) ⋮ Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles ⋮ Extremal problems for the \(p\)-spectral radius of graphs ⋮ Extensions on spectral extrema of \(C_5/C_6\)-free graphs with given size ⋮ Refinement on Spectral Turán’s Theorem ⋮ Spectral radius and edge‐disjoint spanning trees ⋮ Generalizations of some Nordhaus–Gaddum‐type results on spectral radius ⋮ On a conjecture of spectral extremal problems ⋮ On the signless Laplacian spectral radius of irregular graphs ⋮ Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian ⋮ Two conjectured strengthenings of Turán's theorem ⋮ Signed spectral Turań-type theorems ⋮ On sufficient spectral radius conditions for Hamiltonicity of \(k\)-connected graphs ⋮ On completely positive graphs and their complements ⋮ An improvement of sufficient condition for \(k\)-leaf-connected graphs ⋮ The maximum spectral radius of graphs of given size with forbidden subgraph ⋮ Some exact results of the generalized Turán numbers for paths ⋮ Toughness, Hamiltonicity and spectral radius in graphs ⋮ The maximum spectral radius of graphs without friendship subgraphs ⋮ Unnamed Item ⋮ Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph ⋮ Spectral extremal results with forbidding linear forests ⋮ Bounds on graph eigenvalues. II ⋮ A spectral version of Mantel's theorem ⋮ Adjacency eigenvalues of graphs without short odd cycles ⋮ The spectral radius of graphs with no odd wheels ⋮ Spectral radius and \(k\)-connectedness of a graph ⋮ Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius ⋮ The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs ⋮ Distance Laplacian eigenvalues and chromatic number in graphs ⋮ The number of edges, spectral radius and Hamilton-connectedness of graphs ⋮ Analytic methods for uniform hypergraphs ⋮ Spectral results on Hamiltonian problem ⋮ The spectral radius of graphs without paths and cycles of specified length ⋮ The Colin de Verdière parameter, excluded minors, and the spectral radius ⋮ On a poset of trees ⋮ Spectral analogues of Erdős' theorem on Hamilton-connected graphs ⋮ Spectral radius and Hamiltonicity of graphs ⋮ The smallest eigenvalue of \(K_{r}\)-free graphs ⋮ On the sum of \(k\) largest singular values of graphs and matrices ⋮ Nordhaus-Gaddum and other bounds for the sum of squares of the positive eigenvalues of a graph ⋮ Maximum spectral radius of graphs with given connectivity, minimum degree and independence number ⋮ Eigenvalues and chromatic number of a signed graph ⋮ Open problems in the spectral theory of signed graphs ⋮ Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable ⋮ The Nordhaus-Gaddum type inequalities of \(A_\alpha \)-matrix ⋮ Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs ⋮ Ramsey games with giants ⋮ Remarks on Spectral Radius and Laplacian Eigenvalues of a Graph ⋮ Spectral radius and traceability of graphs with large minimum degree ⋮ Matchings in regular graphs from eigenvalues ⋮ Turán's theorem implies Stanley's bound ⋮ Open problems on graph eigenvalues studied with AutoGraphiX ⋮ Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphs ⋮ The maximum spectral radius of \(C_4\)-free graphs of given order and size ⋮ Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius ⋮ Spectral radius and Hamiltonian properties of graphs ⋮ Spectral radius and Hamiltonicity of graphs with large minimum degree ⋮ Bipartite graphs with bounded vertex degree and largest eigenvalue of the form \(\sqrt{r} \) ⋮ Eigenvalues and triangles in graphs
This page was built for publication: Some Inequalities for the Largest Eigenvalue of a Graph
