20.500.12556/RUL-190439 The strong spectral property for some families of unicyclic graphs To find all the possible spectra of all real symmetric matrices whose off-diagonal pattern is prescribed by the adjacencies of a given graph G, the Strong Spectral Property turns out to be of crucial importance. In particular, we investigate the set $\mathcal{G}$$^{SSP}$ of all simple graphs G with the property that each symmetric matrix of the pattern of G has the Strong Spectral Property. In this paper, we completely characterize unicyclic graphs of girth three in $\mathcal{G}$$^{SSP}$. We prove that any tadpole graph of girth at most five is in $\mathcal{G}$$^{SSP}$ and we show that the same is not valid for girth six tadpole graphs. symmetric matrix strong spectral property inverse eigenvalue problem simetrična matrika krepka spektralna lastnost inverzni problem lastnih vrednosti true false true Angleški jezik Slovenski jezik Članek v reviji 2026-10-29 08:54:28 2026-10-29 08:54:29 2026-10-30 04:14:34 0000-00-00 00:00:00 2027 0 0 Str. 151-174 Vol. 754 Feb. 2027 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 519.17:512.643 0024-3795 10.1016/j.laa.2026.10.023 302420995 The_strong_spectral_Koljancic_Oblak_2027.pdf The_strong_spectral_Koljancic_Oblak_2027.pdf 1 E1899AF2BC1678FDD009C8E413DA0C25 31aab394258f20e8b7c015ee4df85e4f92bb56b05bfc6b2eec27899f822c6c8c e417a0d3-d370-11f1-aea2-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=251777 https://www.sciencedirect.com/science/article/pii/S0024379526004222?vi%20a%3Dihub 1 f894b78c-d36d-11f1-aea2-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=251775 Fakulteta za računalništvo in informatiko 0 0 0