Ordered multiplicity inverse eigenvalue problem for graphs on six vertices

MaRDI QIDQ4989751zbMATH OpenFDO

Authors

Publication date 26 May 2021

Full work available at URL https://arxiv.org/abs/1708.02438, https://journals.uwyo.edu/index.php/ela/article/view/5005

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

inverse eigenvalue problemcloningspectrally arbitrarystrong spectral propertyordered multiplicity

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Abstract: For a graph $G$, we associate a family of real symmetric matrices, $mathcalS(G)$, where for any $MinmathcalS(G)$, the location of the nonzero off-diagonal entries of $M$ are governed by the adjacency structure of $G$. The ordered multiplicity Inverse Eigenvalue Problem of a Graph (IEPG) is concerned with finding all attainable ordered lists of eigenvalue multiplicities for matrices in $mathcalS(G)$. For connected graphs of order six, we offer significant progress on the IEPG, as well as a complete solution to the ordered multiplicity IEPG. We also show that while $K_{m,n}$ with $min(m,n)ge3$ attains a particular ordered multiplicity list, it cannot do so with arbitrary spectrum.

Recommendations

• A zero forcing technique for bounding sums of eigenvalue multiplicities
• The inverse eigenvalue problem of a graph: multiplicities and minors
• Achievable multiplicity partitions in the inverse eigenvalue problem 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.

Cites work

• scientific article; zbMATH DE number 1232919 (Why is no real title available?)
• Applications of analysis to the determination of the minimum number of distinct eigenvalues of a graph
• Computing inertia sets using atoms
• Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
• On the eigenvalues of generalized and double generalized stars
• Spectral graph theory and the inverse eigenvalue problem of a graph
• The inverse eigenvalue problem for Hermitian matrices whose graphs are cycles
• The inverse eigenvalue problem of a graph: multiplicities and minors
• The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
• Zero forcing parameters and minimum rank problems
• Zero forcing sets and the minimum rank of graphs

Cited in

(18)

• Graphs that allow all the eigenvalue multiplicities to be even
• On the inverse eigenvalue problem for block graphs
• Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
• The strong spectral property of graphs: graph operations and barbell partitions
• On the minimum number of distinct eigenvalues of a threshold graph
• The liberation set in the inverse eigenvalue problem of a graph
• Distinct eigenvalues are realizable with generic eigenvectors
• The strong spectral property for graphs
• Spectral arbitrariness for trees fails spectacularly
• scientific article; zbMATH DE number 7640506 (Why is no real title available?)
• scientific article; zbMATH DE number 11798 (Why is no real title available?)
• Sparks of symmetric matrices and their graphs
• Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs
• Sparsity of graphs that allow two distinct eigenvalues
• Regular graphs of degree at most four that allow two distinct eigenvalues
• Orthogonal symmetric matrices and joins of graphs
• A zero forcing technique for bounding sums of eigenvalue multiplicities
• A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph

This page was built for publication: Ordered multiplicity inverse eigenvalue problem for graphs on six vertices

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