Graphs with least eigenvalue -2 attaining a convex quadratic upper bound for the stability number
From MaRDI portal
Publication:2914024
DOI10.2298/BMAT0631041CzbMath1265.05353OpenAlexW2008383433MaRDI QIDQ2914024
Domingos Moreira Cardoso, Dragos Cvetković
Publication date: 21 September 2012
Published in: Bulletin: Classe des sciences mathematiques et natturalles (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/bmat0631041c
line graphHoffman boundgeneralized line graphsconvex quadratic programming upper boundregular exceptional graphs
Quadratic programming (90C20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items
A sharp lower bound on the signless Laplacian index of graphs with \((\kappa,\tau)\)-regular sets, Spectral Bounds for the k-Regular Induced Subgraph Problem, A characterization of Delsarte's linear programming bound as a ratio bound, A recursive construction of the regular exceptional graphs with least eigenvalue \(-2\), Maximum \(k\)-regular induced subgraphs, Graphs with least eigenvalue \(-2\): ten years on, A note on the positive semidefiniteness of \(A_{\alpha}(G)\), A survey on graphs with convex quadratic stability number, New results for recognizing convex-QP adverse graphs, Relations between (κ, τ)-regular sets and star complements, An overview of \((\kappa, \tau)\)-regular sets and their applications
