E. Andrade | Searcharxiv

arXiv2018

First Joint Observations of Space Weather Events over Mexico

The Mexican Space Weather Service (SCiESMEX in Spanish) and National Space Weather Laboratory (LANCE in Spanish) were organized in 2014 and in 2016 respectively to provide space weather monitoring and alerts, as well as scientific research in Mexico. In this work, we present the results of the first joint observations of two events (22 June, 2015, and 29 September, 2015) with our local network of instruments and their related products. This network includes the MEXART radio telescope (solar flare and radio burst), the Compact Astronomical Low-frequency, Low-cost Instrument for Spectroscopy in Transportable Observatories (CALLISTO) at MEXART station (solar radio burst), the Mexico City Cosmic Ray Observatory (cosmics ray fluxes), GPS receiver networks (ionospheric disturbances), and the Geomagnetic Observatory of Teoloyucan (geomagnetic field). The observations show that we detected significant space weather effects over the Mexican territory: geomagnetic and ionospheric disturbances (22 June, 2015), variations in cosmic rays fluxes, and also radio communications interferences (29 September, 2015). The effects of these perturbations were registered, for the first time, using space weather products by SCiESMEX: TEC maps, regional geomagnetic index K mex , radio spectrographs of low frequency, and cosmic rays fluxes. These results prove the importance of monitoring space weather phenomena in the region and the need to strengthening the instrumentation network.

physics.space-ph↗

arXiv2018

Bounds for Different Spreads of Line and Total Graphs

In this paper we explore some results concerning the spread of the line and the total graph of a given graph. In particular, it is proved that for an $(n,m)$ connected graph $G$ with $m > n \geq 4$ the spread of $G$ is less than or equal to the spread of its line graph, where the equality holds if and only if $G$ is regular bipartite. A sufficient condition for the spread of the graph not be greater than the signless Laplacian spread for a class of non bipartite and non regular graphs is proved. Additionally, we derive an upper bound for the spread of the line graph of graphs on $n$ vertices having a vertex (edge) connectivity less than or equal to a positive integer $k$. Combining techniques of interlacing of eigenvalues, we derive lower bounds for the Laplacian and signless Laplacian spread of the total graph of a connected graph. Moreover, for a regular graph, an upper and lower bound for the spread of its total graph is given.

math.SP↗