Split Nonthreshold Laplacian Integral Graphs

The aim of this article is to answer a question posed by Merris in European Journal of Combinatorics, 24(2003)413¡430, about the pos sibility of finding split nonthreshold graphs that are Laplacian integral, i.e., graphs for which the eigenvalues of the corresponding Laplacian matrix are integers. Using Kronecker products, balanced incomplete block designs, and solutions to certain Diophantine equations, we show how to build infinite families of these graphs

Computing the Determinant of the Distance Matrix of a Bicyclic Graph

Let G be a connected graph with vertex set V = {v1, ..., vn}. The distance d(vi, vj) between two vertices vi and vj is the number of edges of a shortest path linking them. The distance matrix of G is the n × n matrix such that its (i, j)-entry is equal to d(vi, vj). A formula to compute the determinant of this matrix in terms of the number of vertices was found when the graph either is a tree or is a unicyclic graph. For a byciclic graph, the determinant is known in the case where the cycles have no common edges. In this paper, we present some advances for the remaining cases; i.e., when the cycles share at least one edge. We also present a conjecture for the unsolved cases.Fil: Dratman, Ezequiel. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de General Sarmiento. Instituto de Ciencias; ArgentinaFil: Grippo, Luciano Norberto. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de General Sarmiento. Instituto de Ciencias; ArgentinaFil: Safe, Martin Dario. Universidad Nacional del Sur. Departamento de Matemática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: da Silva Jr., Celso M. Centro Federal de Educação Tecnológica; BrasilFil: Del Vecchio, Renata R.. Universidade Federal Fluminense; BrasilLAGOS 2019: X Latin and American Algorithms, Graphs and Optimization SymposiumBelo HorizonteBrasilUniversidad Federal de Minas Gerai

The MAORY first-light adaptive optics module for E-ELT

The MAORY adaptive optics module is part of the first light instrumentation suite for the E-ELT. The MAORY project phase B is going to start soon. This paper contains a system-level overview of the current instrument design

MAORY: adaptive optics module for the E-ELT

MAORY is one of the four instruments for the E-ELT approved for construction. It is an adaptive optics module offering two compensation modes: multi-conjugate and single-conjugate adaptive optics. The project has recently entered its phase B. A system-level overview of the current status of the project is given in this paper