Efficient eigenvalue counts for tree-like networks (2022)
Guzman, Grover Enrique Castro 
; Stadler, Peter F. ; Fujita, André
Fonte: Journal of Complex Networks. Unidade: IME
Assuntos: COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GUZMAN, Grover Enrique Castro e STADLER, Peter F. e FUJITA, André. Efficient eigenvalue counts for tree-like networks. Journal of Complex Networks, v. 10, n. 5, 2022Tradução . . Disponível em: https://doi.org/10.1093/comnet/cnac040. Acesso em: 09 nov. 2025.APA
Guzman, G. E. C., Stadler, P. F., & Fujita, A. (2022). Efficient eigenvalue counts for tree-like networks. Journal of Complex Networks, 10( 5). doi:10.1093/comnet/cnac040NLM
Guzman GEC, Stadler PF, Fujita A. Efficient eigenvalue counts for tree-like networks [Internet]. Journal of Complex Networks. 2022 ; 10( 5):[citado 2025 nov. 09 ] Available from: https://doi.org/10.1093/comnet/cnac040Vancouver
Guzman GEC, Stadler PF, Fujita A. Efficient eigenvalue counts for tree-like networks [Internet]. Journal of Complex Networks. 2022 ; 10( 5):[citado 2025 nov. 09 ] Available from: https://doi.org/10.1093/comnet/cnac040
