Spectral graph theory and the inverse eigenvalue problem of a graph
Spectral Graph Theory is the study of the spectra of certain matrices defined from a given graph, including the adjacency matrix, the Laplacian matrix and other related matrices. Graph spectra have been studied extensively for more than fifty years. In the last fifteen years, interest has developed in the study of generalized Laplacian matrices of a graph, that is, real symmetric matrices with negative off-diagonal entries in the positions described by the edges of the graph (and zero in every other off-diagonal position). The set of all real symmetric matrices having nonzero off-diagonal entries exactly where the graph \(G\) has edges is denoted by \(\mathcal S(G)\). Given a graph \(G\), the problem of characterizing the possible spectra of \(B\), such that \(B \in \mathcal S(G)\), has been referred to as the Inverse Eigenvalue Problem of a Graph. In the last fifteen years a number of papers on this problem have appeared, primarily concerning trees. The adjacency matrix and Laplacian matrix of \(G\) and their normalized forms are all in \(\mathcal S(G)\). Recent work on generalized Laplacians and Colin de Verdi`ere matrices is bringing the two areas closer together. This paper surveys results in Spectral Graph Theory and the Inverse Eigenvalue Problem of a Graph, examines the connections between these problems, and presents some new results on construction of a matrix of minimum rank for a given graph having a special form such as a \(0,1\)-matrix or a generalized Laplacian.
- Inverse eigenvalue problems for acyclic matrices whose graph is a dense centipede
- The inverse eigenvalue problem of a graph: multiplicities and minors
- Rigid linkages and partial zero forcing
- The minimax inverse eigenvalue problem for matrices whose graph is a generalized star of depth 2
- Spectral preorder and perturbations of discrete weighted graphs
- On the minimum number of distinct eigenvalues of a threshold graph
- The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph
- A geometric Gauss-Newton method for least squares inverse eigenvalue problems
- Spectral properties of inverse sum indeg index of graphs
- On the minimum number of distinct eigenvalues in the problem for a tree formed by Stieltjes strings
- On the inverse eigenvalue problem for block graphs
- Critical ideals, minimum rank and zero forcing number
- Inverse eigenvalue problem for constructing a kind of acyclic matrices with two eigenpairs.
- Characterizing cospectral vertices via isospectral reduction
- On the inverse eigenvalue problem for a special kind of acyclic matrices.
- The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic
- Modification and comparative analysis of smooth control laws for a group of agents
- Generalized inverse eigenvalue problem for matrices whose graph is a path
- The minimum rank of matrices and the equivalence class graph
- A \(q\)-analogue of the distance matrix of a tree
- A matrix representation of graphs and its spectrum as a graph invariant
- Rational realizations of the minimum rank of a sign pattern matrix
- Graph diameter, eigenvalues, and minimum-time consensus
- Inverse eigenvalue problems for two special acyclic matrices
- The isospectral problem in graph theory
- Preserving positivity for matrices with sparsity constraints
- Algebraic aspects of the normalized Laplacian
- The inverse eigenvalue and inertia problems for minimum rank two graphs
- A panorama of positivity. II: Fixed dimension
- scientific article; zbMATH DE number 3931056 (Why is no real title available?)
- scientific article; zbMATH DE number 6810669 (Why is no real title available?)
- Inverse eigenvalue problems with partial eigen data for acyclic matrices whose graph is a broom
- scientific article; zbMATH DE number 2149405 (Why is no real title available?)
- Spectral graph theory and the inverse eigenvalue problem of a graph
- Ordered multiplicity inverse eigenvalue problem for graphs on six vertices
- On the inverse eigenvalue problem for periodic Jacobi matrices
- On inverse eigenvalue problems for two kinds of special banded matrices
- Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph
- The inverse eigenvalue problem of a graph
- Direct and Inverse Finite-Dimensional Spectral Problems on Graphs
- Inverse spectral problem for quantum graphs
- Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition
- Inverse spectral problems for arrowhead matrices
- On the inverse eigenvalue problem for a specific symmetric matrix
- The liberation set in the inverse eigenvalue problem of a graph
- The inverse nullity pair problem and the strong nullity interlacing property
- Relationships between minimum rank problem parameters for cobipartite graphs
- Advanced bounds for eigenvalues in spectral fuzzy graph theory
- Inverse eigenvalue problems for composite banded tridiagonal matrices: symmetric and nonsymmetric cases
- On acyclic and unicyclic graphs whose minimum rank equals the diameter
- Techniques for determining the minimum rank of a small graph
- The minimum rank of symmetric matrices described by a graph: a survey
This page was built for publication: Spectral graph theory and 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 Q4656585)
