20.500.12556/RUL-169919 Orthogonalisability of joins of graphs A 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. symmetric matrix orthogonal matrix inverse eigenvalue problem minimum number of distinct eigenvalues join of graphs simetrična matrika ortogonalna matrika najmanjše število različnih lastnih vrednosti spoj grafov inverzni problem lastnih vrednosti true false true Angleški jezik Slovenski jezik Članek v reviji 2025-06-16 13:44:10 2025-06-16 13:44:12 2026-06-29 11:42:31 0000-00-00 00:00:00 2025 0 0 Str. 162-181 Vol. 723 Oct. 2025 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 519.17 0024-3795 10.1016/j.laa.2025.06.001 239398147 1-s2.0-S0024379525002459-main.pdf 1-s2.0-S0024379525002459-main.pdf 1 9C649CCF7318AFB1CDDA92189811AD07 b5c855721ad0e4e5cf11b0fe24bb0a15fee8f42810d6fb1535d48fe5204f4ff0 2a4bb016-4aa6-11f0-b232-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=211696 https://www.sciencedirect.com/science/article/pii/S0024379525002459 0 ae3a2170-4aa5-11f0-b232-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=211695 Fakulteta za računalništvo in informatiko Fakulteta za matematiko in fiziko 0 0 0