The strong spectral property for some families of unicyclic graphsKoljančić, Sara (Avtor) Oblak, Polona (Avtor) symmetric matrixstrong spectral propertyinverse eigenvalue problemTo 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.20272026-10-29 08:54:28Članek v reviji190439UDK: 519.17:512.643ISSN pri članku: 0024-3795DOI: 10.1016/j.laa.2026.10.023COBISS_ID: 302420995sl