Ordered multiplicity inverse eigenvalue problem for graphs on six vertices

zbMATH Open1464.05225arXiv1708.02438MaRDI QIDQ4989751FDOQ4989751

Author name not available (Why is that?)

Publication date: 26 May 2021

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.

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

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

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.

zbMATH Keywords

inverse eigenvalue problemcloningspectrally arbitrarystrong spectral propertyordered multiplicity

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (17)

• 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
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• 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)