Orthogonalisability of joins of graphsLevene, Rupert H. (Avtor) Oblak, Polona (Avtor) Šmigoc, Helena (Avtor) symmetric matrixorthogonal matrixinverse eigenvalue problemminimum number of distinct eigenvaluesjoin of graphsA graph is said to be orthogonalisable if the set of real symmetric matrices whose off-diagonal pattern is prescribed by its edges contains an orthogonal matrix. We determine some necessary and some sufficient conditions on the sizes of the connected components of two graphs for their join to be orthogonalisable. In some cases, those conditions coincide, and we present several families of joins of graphs that are orthogonalisable.20252025-06-16 13:44:10Članek v reviji169919UDK: 519.17ISSN pri članku: 0024-3795DOI: 10.1016/j.laa.2025.06.001COBISS_ID: 239398147sl