The strong spectral property for graphs

DOI10.1016/J.LAA.2020.03.031MaRDI QIDQ2173323zbMATH OpenOpenAlexFDO

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

Publication date 22 April 2020

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

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

zbMATH Keywords

inverse eigenvalue problemstrong spectral propertysymmetric matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57)

Abstract: We introduce the set $mathcal{G}^{mSSP}$ of all simple graphs $G$ with the property that each symmetric matrix corresponding to a graph $Ginmathcal{G}^{mSSP}$ has the strong spectral property. We find several families of graphs in $mathcal{G}^{mSSP}$ and, in particular, characterise the trees in $mathcal{G}^{mSSP}$.

Recommendations

• scientific article; zbMATH DE number 1264877
• The inverse eigenvalue problem of a graph: multiplicities and minors
• Acyclic matrices with a small number of distinct eigenvalues
• Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
• On strongly regular signed graphs

Cites work

• A characterization of tridiagonal matrices
• A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph
• A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
• Applications of analysis to the determination of the minimum number of distinct eigenvalues of a graph
• Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
• scientific article; zbMATH DE number 1232919 (Why is no real title available?)
• scientific article; zbMATH DE number 475583 (Why is no real title available?)
• Inverse problems in vibrations.
• Minimum number of distinct eigenvalues of graphs
• On the null space of a Colin de Verdière matrix
• Ordered multiplicity inverse eigenvalue problem for graphs on six vertices
• Some connectivity properties for excluded minors of the graph invariant (G)
• Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
• 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 inertia set of a signed graph
• The inverse eigenvalue problem of a graph: multiplicities and minors
• The minimum rank of symmetric matrices described by a graph: a survey
• The strong Arnold property for 4-connected flat graphs
• Using a new zero forcing process to guarantee the strong Arnold property
• Zero forcing sets and the minimum rank of graphs

Cited in

(8)

• The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph
• On the inverse eigenvalue problem for block graphs
• scientific article; zbMATH DE number 6288910 (Why is no real title available?)
• Strong Cospectrality and Twin Vertices in Weighted Graphs
• The strong spectral property of graphs: graph operations and barbell partitions
• The liberation set in the inverse eigenvalue problem of a graph
• Inverse eigenvalue problem for discrete Schrödinger operators of a graph
• Compatible forts and maximum nullity of a graph

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: The strong spectral property for graphs

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