1 citations · 1 across the 4 of their papers we have counts for
6 papers
Arithmetical structures on dominated polynomials
Carlos E. Valencia, Ralihe R. Villagrán
In~\cite{algorithmic} was given an algorithm that computes arithmetical structures on matrices. We use some of the ideas contained there to get an algorithm that computes arithmeti…
Constructions of cospectral graphs with different zero forcing numbers
Aida Abiad, Boris Brimkov, Jane Breen +3
Several researchers have recently explored various graph parameters that can or cannot be characterized by the spectrum of a matrix associated with a graph. In this paper we show t…
Algorithmic aspects of arithmetical structures
Carlos E. Valencia, R. R. Villagrán
Arithmetical structures on graphs were first introduced in \cite{Lorenzini89}. Later in \cite{arithmetical} they were further studied in the setting of square non-negative integer…
Hadamard diagonalizable graphs of order at most 36
Jane Breen, Steve Butler, Melissa Fuentes +7
If the Laplacian matrix of a graph has a full set of orthogonal eigenvectors with entries , then the matrix formed by taking the columns as the eigenvectors is a Hadamard mat…
The structure of sandpile groups of outerplanar graphs
Carlos A. Alfaro, Ralihe R. Villagrán
We compute the sandpile groups of families of planar graphs having a common weak dual by evaluating the indeterminates of the critical ideals of the weak dual at the lengths of the…
Graphs with few trivial characteristic ideals
Carlos A. Alfaro, Michael D. Barrus, John Sinkovic +1
We give a characterization of the graphs with at most three trivial characteristic ideals. This implies the complete characterization of the regular graphs whose critical groups ha…