Complementarity eigenvalue analysis of connected graphs
From MaRDI portal
Recommendations
Cites work
- A differential approach for bounding the index of graphs under perturbations
- A nonsmooth algorithm for cone-constrained eigenvalue problems
- A survey on integral graphs
- A table of connected graphs on six vertices
- Bounds for the spectral radius of a graph when nodes are removed
- Complementary eigenvalues of graphs
- Cone-constrained eigenvalue problems: Theory and algorithms
- Constructing cospectral graphs
- Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions
- scientific article; zbMATH DE number 3477222 (Why is no real title available?)
- scientific article; zbMATH DE number 3556153 (Why is no real title available?)
- scientific article; zbMATH DE number 3577223 (Why is no real title available?)
- On cardinality of Pareto spectra
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
- Principal eigenvectors of irregular graphs
- The characteristic polynomial of a graph
- The symmetric eigenvalue complementarity problem
- Which graphs are determined by their spectrum?
Cited in
(27)- On spectral maps induced by convex cones
- A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem
- Complementarity spectrum of digraphs
- Cone-constrained eigenvalue problems: structure of cone spectra
- On Pareto eigenvalue of distance matrix of a graph
- New results on Pareto spectra
- Repetition of spectral radiuses among connected induced subgraphs
- On cardinality of complementarity spectra of connected graphs
- Determining graphs by the complementary spectrum
- Extremal problems involving the two largest complementarity eigenvalues of a graph
- Complementary eigenvalues of graphs
- Measuring similarity between connected graphs: the role of induced subgraphs and complementarity eigenvalues
- On the maximal number of Pareto eigenvalues in a matrix of given order
- An alternating direction method of multipliers for the eigenvalue complementarity problem
- Complementarity eigenvalues and graph determination
- Vertex-removal, vertex-addition and different notions of similarity for vertices of a graph
- 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
- Graphs sharing an arbitrary number of ordered complementarity eigenvalues
- New results on complementarity spectra of connected graphs
- A unified criterion for distinguishing graphs by their spectral radius
- Largest and least H-eigenvalues of symmetric tensors and hypergraphs
- Pareto singular values of Boolean matrices and analysis of bipartite graphs
- Graphs of order n with exactly n+1 complementarity eigenvalues
- Research on semismooth Newton methods for generalized quadratic eigenvalue complementarity problems on nonnegative cones
- Localization of complementarity eigenvalues
This page was built for publication: Complementarity eigenvalue analysis of connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1698597)