8.6k citations
- Centre National de la Recherche ScientifiqueFR48 papers
- Osservatorio Astronomico di PadovaIT41 papers
- Universidad Complutense de MadridES41 papers
- Centro de AstrobiologíaES34 papers
- Universidad de SevillaES33 papers
- Universidad Nacional de Educación a DistanciaES29 papers
- Laboratoire d'Astrophysique de BordeauxFR26 papers
- National Institute for AstrophysicsIT25 papers
- University of CambridgeGB25 papers
- European Southern ObservatoryCL22 papers
- Institut d'Astrophysique de ParisFR22 papers
- Universitat Rovira i VirgiliES22 papers
13 papers · 1 filter
On the strong partition dimension of graphs
Ismael Gonzalez Yero
We present a different way to obtain generators of metric spaces having the property that the ``position'' of every element of the space is uniquely determined by the distances fro…
The k-metric dimension of a graph
Alejandro Estrada-Moreno, Juan A. Rodríguez-Velázquez, Ismael G. Yero
As a generalization of the concept of a metric basis, this article introduces the notion of -metric basis in graphs. Given a connected graph , a set is s…
The Gaia astrophysical parameters inference system (Apsis). Pre-launch description
C. A. L. Bailer-Jones, R. Andrae, B. Arcay +46
The Gaia satellite will survey the entire celestial sphere down to 20th magnitude, obtaining astrometry, photometry, and low resolution spectrophotometry on one billion astronomica…
Strong metric dimension of rooted product graphs
Dorota Kuziak, Ismael G. Yero, Juan A. Rodríguez-Velázquez
Let be a connected graph. A vertex strongly resolves a pair , of vertices of if there exists some shortest path containing or some shortest path…
Computing the metric dimension of a graph from primary subgraphs
D. Kuziak, J. A. Rodríguez-Velázquez, I. G. Yero
Let be a connected graph. Given an ordered set and a vertex , the representation of with respect to is the ordered…
On the strong metric dimension of Cartesian and direct products of graphs
Juan A. Rodríguez-Velázquez, Ismael G. Yero, Dorota Kuziak +1
Let be a connected graph. A vertex {\em strongly resolves} a pair of vertices of if there exists some shortest path containing or some shortest p…