1 citations · 1 across the 6 of their papers we have counts for
6 papers
Distance ideals of digraphs
Carlos A. Alfaro, Teresa I. Hoekstra-Mendoza, Juan Pablo Serrano +1
We focus on strongly connected, strong for short, digraphs since in this setting distance is defined for every pair of vertices. Distance ideals generalize the spectrum and Smith n…
Distinguishing graphs with two integer matrices
Carlos A. Alfaro, Ralihe R. Villagrán, Octavio Zapata
It is well known that the spectrum and the Smith normal form of a matrix can be computed in polynomial time. Thus, it is interesting to explore how good are these parameters for di…
Distinguishing graphs by their spectra, Smith normal forms and complements
Aida Abiad, Carlos A. Alfaro, Ralihe R. Villagrán
The search for a highly discriminating and easily computable invariant to distinguish graphs remains a challenging research topic. Here we focus on cospectral graphs whose compleme…
The crossing number of the cone of a graph
Carlos A. Alfaro, Alan Arroyo, Marek Derunár +1
Motivated by a problem asked by Richter and by the long standing Harary-Hill conjecture, we study the relation between the crossing number of a graph and the crossing number of…
Optimizing the Production Cost of Minting with Mixed Integer Programming
Carlos A. Alfaro, Raúl Martínez-Noriega, César Guadarrama +2
For central banks, managing the minting is one of the most important task since a shortage yields negative economic and social impacts, and the budget committed for minting is one…
Dimension Reduction in Principal Component Analysis for Trees
Carlos A. Alfaro, Burcu Aydın, Elizabeth Bullitt +2
The statistical analysis of tree structured data is a new topic in statistics with wide application areas. Some Principal Component Analysis (PCA) ideas were previously developed f…