Some Inequalities for the Largest Eigenvalue of a Graph
From MaRDI portal
Publication:3147278
DOI10.1017/S0963548301004928zbMath1005.05029MaRDI QIDQ3147278
Publication date: 11 February 2003
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Related Items
On a poset of trees, On the sum of \(k\) largest singular values of graphs and matrices, Walks and the spectral radius of graphs, Bounds on graph eigenvalues. I, Eigenvalue problems of Nordhaus--Gaddum type, Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph, The spectral radius of graphs without paths and cycles of specified length, Matchings in regular graphs from eigenvalues, The maximum spectral radius of \(C_4\)-free graphs of given order and size, More spectral bounds on the clique and independence numbers, On completely positive graphs and their complements, Numerical radius and zero pattern of matrices, Bounds on graph eigenvalues. II, The smallest eigenvalue of \(K_{r}\)-free graphs, Cliques and the spectral radius, Ramsey games with giants, Remarks on Spectral Radius and Laplacian Eigenvalues of a Graph
