Navegação Ciências Exatas e da Terra por Autor "Trevisan, Vilmar"

Resultados 1-6 de 6

    • Um algoritmo algebrico para isolar zeros polinomiais complexos 

      Camargo, Maria Angelica de Oliveira; Trevisan, Vilmar; Claudio, Dalcidio Moraes (1995) [Artigo de periódico]
      O presente trabalho trata do problema de isolar zeros de polinômios • complexos. Muitos algoritmos calculam zeros polinomiais, a partir de regiões iniciais disjuntas, cada uma contendo um único zero. Entre tanto o problema ...

    • Independence and matching numbers of unicyclic graphs from null space 

      Allem, Luiz Emílio; Jaume, Daniel Alejandro; Molina, Gonzalo; Toledo, Maikon Machado; Trevisan, Vilmar (2020) [Artigo de periódico]
      We characterize unicyclic graphs that are singular using the support of the null space of their pendant trees. From this, we obtain closed formulas for the independence and matching numbers of a unicyclic graph, based on ...

    • Locating eigenvalues of symmetric matrices - a survey 

      Hoppen, Carlos; Jacobs, David; Trevisan, Vilmar (2024) [Artigo de periódico]
      We survey algorithms for locating eigenvalues of symmetric matrices taking advantage of the underlying graph. We present applications in spectral graph theory.

    • On the spectral characterization of the p-sun and the (p,q)-double sun L. Emilio Allem, Lucas G.M. da Silveira e Vilmar Trevisan 

      Allem, Luiz Emílio; Silveira, Lucas Gabriel Mota da; Trevisan, Vilmar (2022) [Artigo de periódico]
      In 1973 Schwenk [7] proved that almost every tree has a cospectral mate. Inspired by Schwenk's result, in this paper we study the spectrum of two families of trees. The p-sun of order is a star with an edge attached to ...

    • Partial characterization of graphs having a single large Laplacian eigenvalue 

      Allem, Luiz Emílio; Cafure, Antonio Artemio; Dratman, Ezequiel; Grippo, Luciano Norberto; Safe, Martín Darío; Trevisan, Vilmar (2018) [Artigo de periódico]
      The parameter (G) of a graph G stands for the number of Laplacian eigenvalues greater than or equal to the average degree of G. In this work, we address the problem of characterizing those graphs G having (G) = 1. Our ...

    • Spectral ordering and 2-switch transformations 

      Oliveira, Elismar da Rosa; Schvöllner, Victor Nicolas; Trevisan, Vilmar (2022) [Artigo de periódico]
      We address the problem of ordering trees with the same degree sequence by their spectral radii. To achieve that, we consider 2-switch transformations which preserve the degree sequence and establish when the index decreases. ...