All Stories

  1. Brouwer's Conjecture for the Cartesian product of graphs
  2. Graphs sharing an arbitrary number of ordered complementarity eigenvalues
  3. Locating Eigenvalues of Symmetric Matrices - A Survey
  4. Diminimal families of arbitrary diameter
  5. Exploring symmetries in cographs: Obtaining spectra and energies
  6. Adjacency energy of hypergraphs
  7. On the spectral characterization of the p-sun and the (p,q)-double sun
  8. On Quipus whose signless Laplacian index does not exceed 4.5
  9. Laplacian eigenvalue distribution and graph parameters
  10. Distance-Hereditary Graphs
  11. Graph Classes and Graph Decompositions
  12. Introduction
  13. Locating Eigenvalues Using Slick Clique Decomposition
  14. Locating Eigenvalues Using Tree Decomposition
  15. Locating Eigenvalues in Cographs
  16. Locating Eigenvalues in Graphs
  17. Locating Eigenvalues in Trees
  18. Preliminaries
  19. The signless Laplacian matrix of hypergraphs
  20. Complementarity spectrum of digraphs
  21. Applications of rational difference equations to spectral graph theory
  22. Characterizing threshold graphs with k main signless Laplacian eigenvalues
  23. Null decomposition of unicyclic graphs
  24. Energies of Hypergraphs
  25. The spectrum of a class of uniform hypergraphs
  26. Further developments on Brouwer's conjecture for the sum of Laplacian eigenvalues of graphs
  27. Determining graphs by the complementary spectrum
  28. Principal eigenvectors of general hypergraphs
  29. Spectral norm of oriented graphs
  30. Spectral ordering of trees with small index
  31. Eigenvalue location in graphs of small clique-width
  32. Spectral radius ordering of starlike trees
  33. Eigenvalue location in cographs
  34. Autovalores do Produto Forte
  35. Sum of the k Largest Signless Laplacian Eigenvalues
  36. Famílias infinitas de grafos Q-equienergéticos
  37. Maximality of the signless Laplacian energy
  38. Exponentially many graphs have aQ-cospectral mate
  39. Laplacian Distribution and Domination
  40. Complementary eigenvalues of graphs
  41. Grafos split completos com energia laplaciana sem sinal máxima
  42. Maximum Laplacian energy of unicyclic graphs
  43. Spectral threshold dominance, Brouwer's conjecture and maximality of Laplacian energy
  44. Distribution of Laplacian eigenvalues of graphs
  45. A Fiedler-like theory for the perturbed Laplacian
  46. Domination number and Laplacian eigenvalue distribution
  47. Some spectral properties of cographs
  48. Exploring Symmetries to Decompose Matrices and Graphs Preserving the Spectrum
  49. Diagonalization of generalized lollipop graphs
  50. Threshold graphs of maximal Laplacian energy
  51. Trees with 4 or 5 distinct normalized Laplacian eigenvalues
  52. Eigenvalues and energy in threshold graphs
  53. Ordering trees and graphs with few cycles by algebraic connectivity
  54. EL METODO DE CANTOR- ZASSENHAUS PARA FACTORIZAR POLINOMIOS EN CAMPOS FINITOS
  55. Bounding the sum of the largest Laplacian eigenvalues of graphs
  56. Characterizing trees with large Laplacian energy
  57. Preface
  58. Computing the Characteristic Polynomial of Threshold Graphs
  59. Eigenvalue location in threshold graphs
  60. On the distribution of Laplacian eigenvalues of trees
  61. Maximum Laplacian energy among threshold graphs
  62. Extracting sparse factors from multivariate integral polynomials
  63. Unicyclic graphs with equal Laplacian energy
  64. Computing the Laplacian spectra of some graphs
  65. Algebraic connectivity on a subclass of caterpillars
  66. Gcd of multivariate polynomials via Newton polytopes
  67. On the sum of the Laplacian eigenvalues of a tree
  68. Laplacian energy of diameter 3 trees
  69. The Resultant of Chebyshev Polynomials
  70. A note on Gao’s algorithm for polynomial factorization
  71. Locating the Eigenvalues of Trees
  72. A linear model for compound multicommodity network flow problems
  73. Applications of recurrence relations for the characteristic polynomials of Bethe trees
  74. Distance- k knowledge in self-stabilizing algorithms
  75. Distance-k Information in Self-stabilizing Algorithms
  76. Factorization properties of chebyshev polynomials
  77. A modular integer GCD algorithm
  78. Testing the converse of Wolstenholme’s theorem
  79. Linear-time LUP decomposition of forest-like matrices
  80. Rational representation of modular numbers
  81. The determinant of a tree's neighborhood matrix
  82. Reducing the adjacency matrix of a tree
  83. The composite character of the twenty-second Fermat number
  84. Polynomial factorization
  85. Polynomial Factorization: Sharp Bounds, Efficient Algorithms
  86. Practical factorization of univariate polynomials over finite fields
  87. Recognition of Hurwitz polynomials