Complementary eigenvalues of graphs
From MaRDI portal
Publication:2359565
DOI10.1016/J.LAA.2017.03.029zbMATH Open1365.05171OpenAlexW2604930835MaRDI QIDQ2359565FDOQ2359565
Authors: 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
Recommendations
- Complementarity eigenvalues and graph determination
- Complementarity eigenvalue analysis of connected graphs
- scientific article; zbMATH DE number 850069
- scientific article; zbMATH DE number 2149403
- Eigenvalues of complete multipartite graphs
- scientific article; zbMATH DE number 1935539
- Linear combinations of graph eigenvalues
- Eigenvalue comparisons in graph theory
- Eigenvalues of finite graphs
- Eigenvalues and separation in graphs
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Title not available (Why is that?)
- Spectral radius and Hamiltonicity of graphs
- Title not available (Why is that?)
- The directional instability problem in systems with frictional contacts.
- 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
- Variational inequality formulation of the asymmetric eigenvalue complementarity problem and its solution by means of gap functions
- On cardinality of Pareto spectra
- On the asymmetric eigenvalue complementarity problem
- The symmetric eigenvalue complementarity problem
- A nonsmooth algorithm for cone-constrained eigenvalue problems
- Title not available (Why is that?)
- 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
- On the computation of all eigenvalues for the eigenvalue complementarity problem
- Title not available (Why is that?)
- On an enumerative algorithm for solving eigenvalue complementarity problems
- Title not available (Why is that?)
- Open problems of Paul Erd�s in graph theory
- A DC programming approach for solving the symmetric eigenvalue complementarity problem
- Indices for special classes of trees
- Title not available (Why is that?)
- Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
- The Eigenvalues of a Graph and Its Chromatic Number
- On the finiteness of the cone spectrum of certain linear transformations on Euclidean Jordan algebras
- Title not available (Why is that?)
- The perturbed laplacian matrix of a graph
- Graphs with a small number of distinct induced subgraphs
Cited In (27)
- An alternating direction method of multipliers for the eigenvalue complementarity problem
- Graphs sharing an arbitrary number of ordered complementarity eigenvalues
- On cardinality of complementarity spectra of connected graphs
- Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem
- Vertex-removal, vertex-addition and different notions of similarity for vertices of a graph
- On spectral maps induced by convex cones
- New results on complementarity spectra of connected graphs
- A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem
- Characterization of digraphs with three complementarity eigenvalues
- Complementary Vanishing Graphs
- A unified criterion for distinguishing graphs by their spectral radius
- New results on Pareto spectra
- 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
- Complementarity spectrum of digraphs
- Inclusion relations of certain graph eigenspaces
- Spectral radii of friendship graphs and their connected induced subgraphs
- Complementarity eigenvalues and graph determination
- Cone-constrained eigenvalue problems: structure of cone spectra
- On Pareto eigenvalue of distance matrix of a graph
- Linear combinations of graph eigenvalues
- Determining graphs by the complementary spectrum
- Complementarity eigenvalue analysis of connected graphs
- Repetition of spectral radiuses among connected induced subgraphs
- Extremal problems involving the two largest complementarity eigenvalues of a graph
- Pareto H-eigenvalues of nonnegative tensors and uniform hypergraphs
- On the maximal number of Pareto eigenvalues in a matrix of given order
This page was built for publication: Complementary eigenvalues of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2359565)
