The strong spectral property of graphs: graph operations and barbell partitions

DOI10.1007/s00373-023-02745-6arXiv2303.17138WikidataQ128541888 ScholiaQ128541888MaRDI QIDQ6154374

Unnamed Author, Houston Schuerger, Shahla Nasserasr, Ralihe R. Villagrán, Shaun M. Fallat, Sarah R. Allred, Emelie Curl

Publication date: 15 February 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

eigenvaluesgraph operationsstrong spectral propertybarbell partitions

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Inverse problems in linear algebra (15A29) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• The minimum rank of symmetric matrices described by a graph: a survey
• A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph
• Effects of vertex degrees on the zero-forcing number and propagation time of a graph
• Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
• The inverse eigenvalue problem of a graph: multiplicities and minors
• The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph
• The strong spectral property for graphs
• Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
• Ordered multiplicity inverse eigenvalue problem for graphs on six vertices
• Inverse Problems and Zero Forcing for Graphs
• Minimum number of distinct eigenvalues of graphs

This page was built for publication: The strong spectral property of graphs: graph operations and barbell partitions