20.500.12556/RUL-150996 Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs An important facet of the inverse eigenvalue problem for graphs is to determine the minimum number of distinct eigenvalues of a particular graph. We resolve this question for the join of a connected graph with a path. We then focus on bordering a matrix and attempt to control the change in the number of distinct eigenvalues induced by this operation. By applying bordering techniques to the join of graphs, we obtain numerous results on the nature of the minimum number of distinct eigenvalues as vertices are joined to a fixed graph. inverse eigenvalue problem minimum number of distinct eigenvalues borderings joins of graphs paths cycles hypercubes inverzni problem lastnih vrednosti najmanjše število različnih lastnih vrednosti ograjevanje spoj grafov poti cikli hiperkocke true false true Angleški jezik Slovenski jezik Članek v reviji 2023-09-26 14:35:20 2023-09-26 14:35:20 2024-02-05 12:29:46 0000-00-00 00:00:00 2023 0 0 Str. 104-126 Vol. 679 Dec. 2023 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 519.17 0024-3795 10.1016/j.laa.2023.09.013 165826307 1-s2.0-S0024379523003506-main.pdf 1-s2.0-S0024379523003506-main.pdf 1 568ECA4D1C39DD627344BF1A2FDB6889 86ca2c3c3f036096948285669e29b29bb249dac396dd1b43b277654d8615a767 b92ae81f-5c6c-11ee-9c9a-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=175875 https://www.sciencedirect.com/science/article/pii/S0024379523003506 1 28b71539-5c69-11ee-9c9a-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=175874 Fakulteta za računalništvo in informatiko Fakulteta za matematiko in fiziko 0 0 0