• Publications
  • Influence
On the Metric Dimension of Cartesian Products of Graphs
TLDR
A set of vertices $S$ resolves a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. Expand
  • 306
  • 16
  • PDF
Extremal Graph Theory for Metric Dimension and Diameter
TLDR
We characterize the graphs in Gβ,D with order β+D for all values of β and D and determine the maximum order of a graph in G β,D. Expand
  • 121
  • 11
  • PDF
On the Steiner, geodetic and hull numbers of graphs
TLDR
In this paper, we explore the relationships both between Steiner sets and geodetic sets and between Steiners sets and monophonic sets. Expand
  • 75
  • 3
  • PDF
On geodetic sets formed by boundary vertices
TLDR
We prove that the boundary vertex set @?(G) of any graph G is geodetic, and such that every convex set induces a connected subgraph of G. Expand
  • 39
  • 3
  • PDF
Graphs of Non-Crossing Perfect Matchings
TLDR
We prove that ℳm is the graph having as vertices all the perfect matchings in the point set Pn whose edges are straight line segments and do not cross, and that it has no Hamilton path for m odd, m>3. Expand
  • 35
  • 3
  • PDF
On the geodetic and the hull numbers in strong product graphs
TLDR
In this work, we investigate the behavior of both geodetic and hull sets with respect to the strong product operation for graphs. Expand
  • 33
  • 3
  • PDF
On the metric dimension of some families of graphs
TLDR
This work is devoted to evaluating the so-called metric dimension of a finite connected graph for a number of graph families, as long as to study its behavior with respect to the join and the cartesian product of graphs. Expand
  • 128
  • 2
  • PDF
Geodeticity of the contour of chordal graphs
TLDR
A vertex v is a boundary vertex of a connected graph G if there exists a vertex u such that no neighbor of v is further away from u than v. This paper is devoted to study these kinds of vertices for the family of chordal graphs. Expand
  • 20
  • 2
  • PDF
Packing trees into planar graphs
  • 23
  • 2
On local transformation of polygons with visibility properties
TLDR
In this paper, we exhibit a simple local transformation for which the following polygon classes are connected: monotone, x-monotones, star-shaped, (weakly) edge-visible and ( weakly) externally visible. Expand
  • 17
  • 2
...
1
2
...