Orthogonalisability of joins of graphs

DOI10.1016/J.LAA.2025.06.001MaRDI QIDQ6953030zbMATH OpenFDO

Authors Rupert H. Levene, Polona Oblak, Helena Šmigoc

Publication date 25 July 2025

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

Full work available at URL https://doi.org/10.1016/J.LAA.2025.06.001

zbMATH Keywords

inverse eigenvalue problemjoin of graphsminimum number of distinct eigenvaluesorthogonal matrixsymmetric matrix

Mathematics Subject Classification ID

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

Cites work

• A lower bound for the number of distinct eigenvalues of some real symmetric matrices
• A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph
• A theorem on flows in networks
• Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
• Applications of analysis to the determination of the minimum number of distinct eigenvalues of a graph
• Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs
• Combinatorial matrix classes
• Construction of matrices with a given graph and prescribed interlaced spectral data
• Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
• Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
• scientific article; zbMATH DE number 428989 (Why is no real title available?)
• scientific article; zbMATH DE number 3182201 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• Inverse Problems and Zero Forcing for Graphs
• Minimum number of distinct eigenvalues of graphs
• Multiplicity lists for symmetric matrices whose graphs have few missing edges
• On orthogonal matrices with zero diagonal
• On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
• On the minimum number of distinct eigenvalues of a threshold graph
• Orthogonal symmetric matrices and joins of graphs
• Regular graphs of degree at most four that allow two distinct eigenvalues
• Sparsity of graphs that allow two distinct eigenvalues
• Spectra of graphs. Theory and application
• The combinatorial inverse eigenvalue problems: complete graphs and small graphs with strict inequality
• The nowhere-zero eigenbasis problem for a graph

This page was built for publication: Orthogonalisability of joins of graphs

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