Graphs sharing an arbitrary number of ordered complementarity eigenvalues
Let \(A\) be a real matrix of order \(n\). A real number \(\lambda\) is called a complementary eigenvalue of \(A\) if there exists a nonzero vector \(\mathfrak{x}\in\mathbb{R}^n\) such that \[ \mathfrak{x}\geq 0, \quad A\mathfrak{x}-\lambda\mathfrak{x}\geq 0,\quad \mathfrak{x}^\top(A\mathfrak{x}-\lambda\mathfrak{x})=0, \] where \(\mathfrak{x}\geq 0\) means that every entry of vector \(\mathfrak{x}\) is non-negative. The complementary spectrum of \(G\) is the set of distinct complementary eigenvalues of its adjacency matrix. Alternatively, the complementary spectrum of a graph is a finite collection of the different spectral radii of all induced subgraphs, where for a given graph \(G\), the spectral radius is the largest eigenvalue of the adjacency matrix \(A(G)\). The separability index of a class \(\mathcal{G}\) of connected graphs is the minimal number of successive complementary eigenvalues, starting from the largest one, that is needed to separate \(\mathcal{G}\). The main result of the paper shows that for each \(n\geq 15\) there is a pair of connected graphs sharing their \(n-13\) largest complementary eigenvalues but the \(n-12\) largest are different. Therefore, the separability index of such a pair is equal to \(n-12\). In addition, it follows that the separability index of the class of all connected graphs cannot be a constant.
- Complementarity eigenvalue analysis of connected graphs
- Complementarity eigenvalues and graph determination
- Complementary eigenvalues of graphs
- Determining graphs by the complementary spectrum
- Extremal problems involving the two largest complementarity eigenvalues of a graph
- scientific article; zbMATH DE number 3627232 (Why is no real title available?)
- scientific article; zbMATH DE number 3411062 (Why is no real title available?)
- Locating the eigenvalues of trees
- On cardinality of complementarity spectra of connected graphs
- Repetition of spectral radiuses among connected induced subgraphs
- Spectral ordering of trees with small index
- Spectral radii of friendship graphs and their connected induced subgraphs
- Spectral radius ordering of starlike trees
This page was built for publication: Graphs sharing an arbitrary number of ordered complementarity eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136672)
