Complementary eigenvalues of graphs

DOI10.1016/j.laa.2017.03.029zbMath1365.05171OpenAlexW2604930835MaRDI QIDQ2359565

Yanyan Li

Publication date: 22 June 2017

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.03.029

zbMATH Keywords

eigenvalue problemgraphsspectral graph theorycomplementarity problem

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (23)

Solution of fractional quadratic programs on the simplex and application to the eigenvalue complementarity problem ⋮ 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 ⋮ Complementarity eigenvalue analysis of connected graphs ⋮ On cardinality of complementarity spectra of connected graphs ⋮ On spectral maps induced by convex cones ⋮ Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem ⋮ 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A DC programming approach for solving the symmetric eigenvalue complementarity problem
• A nonsmooth algorithm for cone-constrained eigenvalue problems
• On an enumerative algorithm for solving eigenvalue complementarity problems
• On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
• On the finiteness of the cone spectrum of certain linear transformations on Euclidean Jordan algebras
• Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions
• The directional instability problem in systems with frictional contacts.
• Graphs with a small number of distinct induced subgraphs
• On the computation of all eigenvalues for the eigenvalue complementarity problem
• Cone-constrained eigenvalue problems: Theory and algorithms
• Local minima of quadratic forms on convex cones
• A new method for solving second-order cone eigenvalue complementarity problems
• Indices for special classes of trees
• The perturbed laplacian matrix of a graph
• Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem
• On cardinality of Pareto spectra
• On the asymmetric eigenvalue complementarity problem
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• The symmetric eigenvalue complementarity problem
• The Eigenvalues of a Graph and Its Chromatic Number
• Spectral radius and Hamiltonicity of graphs

This page was built for publication: Complementary eigenvalues of graphs