2026-04-28T19:19:44Zhttps://uvadoc.uva.es/oai/requestoai:uvadoc.uva.es:10324/359852025-03-26T19:10:03Zcom_10324_32197com_10324_952com_10324_894col_10324_32199
Marijuán López, Carlos
Pisonero Pérez, Miriam
2019-05-09T07:06:01Z
2019-05-09T07:06:01Z
2018
Electronic Notes in Discrete Mathematics, 2018, vol. 68. p. 95-100
1571-0653
http://uvadoc.uva.es/handle/10324/35985
10.1016/j.endm.2018.06.017
Producción Científica
The problem of characterizing the real spectra of weighted graphs is only solved
for weighted graphs of order n ≤ 4. We overview these known results, that come
from the context of nonnegative matrices, and give a new method to rule out many
unresolved spectra of size 5.
Ministerio de Economía, Industria y Competitividad ( grant MTM2015-365764-C3-1-P)
Universidad de Valladolid (GIR TAMCO)
application/pdf
eng
Elsevier
info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-nd/4.0/
© 2018 Elsevier
Attribution-NonCommercial-NoDerivatives 4.0 International
Weighted graphs
Grafos ponderados
Adjacency matrix
Matriz de adyacencia
Eigenvalue problems
Problemas de valor propio
On spectra of weighted graphs of order ≤5
info:eu-repo/semantics/article
https://www.sciencedirect.com/science/article/pii/S1571065318301082
SI