Complementarity eigenvalue analysis of connected graphs

DOI10.1016/j.laa.2017.12.021zbMath1387.05160OpenAlexW2782531562MaRDI QIDQ1698597

Alberto Seeger

Publication date: 16 February 2018

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2017.12.021

zbMATH Keywords

spectral radiusconnected graphsconnected induced subgraphscomplementarity eigenvalue analysissecond largest complementarity eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42)

Related Items

Measuring similarity between connected graphs: the role of induced subgraphs and complementarity eigenvalues, New results on Pareto spectra, Repetition of spectral radiuses among connected induced subgraphs, Characterization of digraphs with three complementarity eigenvalues, Spectral radii of friendship graphs and their connected induced subgraphs, Pareto H-eigenvalues of nonnegative tensors and uniform hypergraphs, Unnamed Item, Graphs sharing an arbitrary number of ordered complementarity eigenvalues, New results on complementarity spectra of connected graphs, On cardinality of complementarity spectra of connected graphs, On spectral maps induced by convex cones, A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem, Complementarity spectrum of digraphs, Determining graphs by the complementary spectrum, Cone-constrained eigenvalue problems: structure of cone spectra, Extremal problems involving the two largest complementarity eigenvalues of a graph, On Pareto eigenvalue of distance matrix of a graph, On the maximal number of Pareto eigenvalues in a matrix of given order, An alternating direction method of multipliers for the eigenvalue complementarity problem, Vertex-removal, vertex-addition and different notions of similarity for vertices of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds for the spectral radius of a graph when nodes are removed
• A nonsmooth algorithm for cone-constrained eigenvalue problems
• Constructing cospectral graphs
• A differential approach for bounding the index of graphs under perturbations
• A table of connected graphs on six vertices
• On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
• Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions
• Which graphs are determined by their spectrum?
• Cone-constrained eigenvalue problems: Theory and algorithms
• Complementary eigenvalues of graphs
• The characteristic polynomial of a graph
• On cardinality of Pareto spectra
• The symmetric eigenvalue complementarity problem
• A survey on integral graphs