New results about the Inverse Eigenvalue Problem of a Graph
From MaRDI portal
Publication:6429904
arXiv2303.09739MaRDI QIDQ6429904FDOQ6429904
Authors: Roberto C. Díaz, Ana I. Julio
Publication date: 16 March 2023
Abstract: All graphs considered are simple and undirected. The Inverse Eigenvalue Problem of a Graph (IEP-G) aims to find all possible spectra for matrices whose entry, for , is nonzero precisely when is adjacent to . A cluster in a graph is a pair of vertex subsets , where is a maximal set of cardinality of independent vertices sharing the same set of neighbors. Let be a connected graph on vertices with a cluster and be a graph of order . Let be the connected graph obtained from and when the edges of are added to the edges of by identifying the vertices of with the vertices in . In this paper, we construct a symmetric matrix with associated complete graph, which satisfies some interesting properties. This result is applied to obtain new sufficient conditions on the IEP-G, when is a graph of order having a clique of order and a cluster , where and , as well as, for the graph , being as before. In particular, when is a graph obtained from by deleting a single edge , we establish a necessary and sufficient condition on the IEP-G. Several illustrative example are given. The constructive nature of our results generate algorithmic procedures that always allow one to compute a solution matrix.
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57) Graph operations (line graphs, products, etc.) (05C76) Numerical solutions to inverse eigenvalue problems (65F18)
This page was built for publication: New results about the Inverse Eigenvalue Problem of a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6429904)