On the inverse eigenvalue problem for block graphs

DOI10.1016/J.LAA.2021.09.008MaRDI QIDQ2238880zbMATH OpenOpenAlexFDO

Authors Jephian Chin-Hung Lin, Polona Oblak, Helena Šmigoc

Publication date 2 November 2021

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2012.12495

zbMATH Keywords

inverse eigenvalue problemsymmetric matrixblock graphstrong spectral property

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57) Numerical solutions to inverse eigenvalue problems (65F18)

Abstract: The inverse eigenvalue problem of a graph $G$ aims to find all possible spectra for matrices whose $(i,j)$-entry, for $ieqj$, is nonzero precisely when $i$ is adjacent to $j$. In this work, the inverse eigenvalue problem is completely solved for a subfamily of clique-path graphs, in particular for lollipop graphs and generalized barbell graphs. For a matrix $A$ with associated graph $G$, a new technique utilizing the strong spectral property is introduced, allowing us to construct a matrix $A^{\prime }$ whose graph is obtained from $G$ by appending a clique while arbitrary list of eigenvalues is added to the spectrum. Consequently, many spectra are shown realizable for block graphs.

Recommendations

• The inverse eigenvalue problem of a graph
• Inverse eigenvalue problems on directed graphs
• The inverse eigenvalue problem of a graph: multiplicities and minors
• Spectral graph theory and the inverse eigenvalue problem of a graph
• Spectral graph theory and the inverse eigenvalue problem of a graph
• The inverse eigenvalue and inertia problems for minimum rank two graphs
• The combinatorial inverse eigenvalue problems: complete graphs and small graphs with strict inequality
• Two inverse eigenvalue problems for matrices whose graphs are trees
• On the Moore-Penrose pseudo-inversion of block symmetric matrices and its application in the graph theory
• Achievable multiplicity partitions in the inverse eigenvalue problem of a graph

Cites work

• scientific article; zbMATH DE number 1232919 (Why is no real title available?)
• scientific article; zbMATH DE number 635657 (Why is no real title available?)
• scientific article; zbMATH DE number 1793704 (Why is no real title available?)
• Applications of analysis to the determination of the minimum number of distinct eigenvalues of a graph
• Construction of a Jacobi matrix from spectral data
• Construction of matrices with a given graph and prescribed interlaced spectral data
• Eigenvalues of nonnegative symmetric matrices
• Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
• Graphs that allow all the eigenvalue multiplicities to be even
• Inverse eigenvalue problems and lists of multiplicities of eigenvalues for matrices whose graph is a tree: The case of generalized stars and double generalized stars.
• Inverse eigenvalue problems for Jacobi matrices
• Inverse problems in vibrations.
• Minimum number of distinct eigenvalues of graphs
• On the construction of a Jacobi matrix from spectral data
• On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
• Ordered multiplicity inverse eigenvalue problem for graphs on six vertices
• The Construction of Jacobi and Periodic Jacobi Matrices With Prescribed Spectra
• The combinatorial inverse eigenvalue problem. II: All cases for small graphs
• The combinatorial inverse eigenvalue problems: complete graphs and small graphs with strict inequality
• The implicit function theorem. History, theory, and applications
• The inverse eigenvalue problem for nonnegative matrices
• The inverse eigenvalue problem of a graph: multiplicities and minors
• The strong spectral property for graphs
• Zero forcing sets and the minimum rank of graphs

Cited in

(6)

• Block-indifference graphs: characterization, structural and spectral properties
• The inverse eigenvalue problem of a graph: multiplicities and minors
• The liberation set in the inverse eigenvalue problem of a graph
• Distinct eigenvalues are realizable with generic eigenvectors
• Spectral arbitrariness for trees fails spectacularly
• Inverse eigenvalue problems with partial eigen data for acyclic matrices whose graph is a broom

This page was built for publication: On the inverse eigenvalue problem for block graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2238880)