New large graphs with given degree and diameter six. - José Gómez; Ignacio M. Pelayo; Camino Balbuena (Networks, 1999)

Some contributions from graph theory to the design and study of large and fault-tolerant interconnection networks. - Ignacio Manuel Pelayo Melero (2000)

On the connectivity of generalized p-cycles. - Ignacio M. Pelayo; Camino Balbuena; José Gómez (Ars Comb., 2001)

Every Cubic Cage is quasi 4-connected. - Xavier Marcote; Ignacio M. Pelayo; Camino Balbuena (Electron. Notes Discret. Math., 2001)

On the superconnectivity of generalized p-cycles. - Camino Balbuena; Ignacio M. Pelayo; José Gómez (Discret. Math., 2002)

Superconnected digraphs and graphs with small conditional diameters. - Camino Balbuena; Josep Fàbrega; Xavier Marcote; Ignacio M. Pelayo (Networks, 2002)

Diameter vulnerability of GC graphs. - José Gómez; Ignacio M. Pelayo; Camino Balbuena (Discret. Appl. Math., 2003)

Using a progressive withdrawal procedure to study superconnectivity in digraphs. - Ignacio M. Pelayo; Xavier Marcote; Camino Balbuena; Josep Fàbrega (Discret. Math., 2003)

Algebraic properties of a digraph and its line digraph. - Camino Balbuena; Daniela Ferrero; Xavier Marcote; Ignacio M. Pelayo (J. Interconnect. Networks, 2003)

Diameter, short paths and superconnectivity in digraphs. - Xavier Marcote; Camino Balbuena; Ignacio M. Pelayo (Discret. Math., 2004)

Comment on "The Steiner number of a graph" by G. Chartrand and P. Zhang: [Discrete Mathematics 242 (2002) 41-54]. - Ignacio M. Pelayo (Discret. Math., 2004)

On the Steiner, geodetic and hull numbers of graphs. - M. Carmen Hernando; Tao Jiang 003; Mercè Mora; Ignacio M. Pelayo; Carlos Seara (Discret. Math., 2005)

(delta, g)-cages with g geq 10 are 4-connected. - Xavier Marcote; Camino Balbuena; Ignacio M. Pelayo; Josep Fàbrega (Discret. Math., 2005)

Searching for geodetic boundary vertex sets. - José Cáceres; María Luz Puertas; M. Carmen Hernando; Mercè Mora; Ignacio M. Pelayo; Carlos Seara (Electron. Notes Discret. Math., 2005)

On the metric dimension of some families of graphs. - M. Carmen Hernando; Mercè Mora; Ignacio M. Pelayo; Carlos Seara; José Cáceres; María Luz Puertas (Electron. Notes Discret. Math., 2005)

On geodetic sets formed by boundary vertices. - José Cáceres; M. Carmen Hernando; Mercè Mora; Ignacio M. Pelayo; María Luz Puertas; Carlos Seara (Discret. Math., 2006)

On the connectivity of cages with girth five, six and eight. - Xavier Marcote; Camino Balbuena; Ignacio M. Pelayo (Discret. Math., 2007)

Extremal Graph Theory for Metric Dimension and Diameter. - M. Carmen Hernando; Mercè Mora; Ignacio M. Pelayo; Carlos Seara; David R. Wood (Electron. Notes Discret. Math., 2007)

On the Metric Dimension of Cartesian Products of Graphs. - José Cáceres; M. Carmen Hernando; Mercè Mora; Ignacio M. Pelayo; María Luz Puertas; Carlos Seara; David R. Wood (SIAM J. Discret. Math., 2007)

Geodeticity of the contour of chordal graphs. - José Cáceres; M. Carmen Hernando; Mercè Mora; Ignacio M. Pelayo; María Luz Puertas; Carlos Seara (Discret. Appl. Math., 2008)

On the geodetic and the hull numbers in strong product graphs. - José Cáceres; M. Carmen Hernando; Mercè Mora; Ignacio M. Pelayo; María Luz Puertas (Comput. Math. Appl., 2010)

On the metric dimension of infinite graphs. - José Cáceres; M. Carmen Hernando; Mercè Mora; Ignacio M. Pelayo; María Luz Puertas (Discret. Appl. Math., 2012)

Locating-dominating codes: Bounds and extremal cardinalities. - José Cáceres; Carmen Hernando 001; Mercè Mora; Ignacio M. Pelayo; María Luz Puertas (Appl. Math. Comput., 2013)

Some structural, metric and convex properties of the boundary of a graph. - M. Carmen Hernando; Mercè Mora; Ignacio M. Pelayo; Carlos Seara (Ars Comb., 2013)

Nordhaus-Gaddum bounds for locating domination. - Carmen Hernando 001; M. Mora 001; Ignacio M. Pelayo (Eur. J. Comb., 2014)

The graph distance game and some graph operations. - José Cáceres; María Luz Puertas; Carmen Hernando 001; M. Mora 001; Ignacio M. Pelayo (Electron. Notes Discret. Math., 2014)

LD-graphs and global location-domination in bipartite graphs. - Carmen Hernando 001; M. Mora 001; Ignacio M. Pelayo (Electron. Notes Discret. Math., 2014)

On global location-domination in graphs. - Carmen Hernando 001; Mercè Mora; Ignacio M. Pelayo (Ars Math. Contemp., 2015)

Quasiperfect Domination in Trees. - José Cáceres; María Luz Puertas; Carmen Hernando 001; Mercè Mora; Ignacio M. Pelayo (Electron. Notes Discret. Math., 2015)

General bounds on limited broadcast domination. - José Cáceres; Carmen Hernando 001; Mercè Mora; Ignacio M. Pelayo; María Luz Puertas (Discret. Math. Theor. Comput. Sci., 2018)

Neighbor-locating coloring: graph operations and extremal cardinalities. - Carmen Hernando 001; Mercè Mora; Ignacio M. Pelayo; Liliana Alcón; Marisa Gutierrez (Electron. Notes Discret. Math., 2018)

Locating domination in bipartite graphs and their complements. - Carmen Hernando 001; M. Mora 001; Ignacio M. Pelayo (Discret. Appl. Math., 2019)

Resolving dominating partitions in graphs. - Carmen Hernando 001; Mercè Mora; Ignacio M. Pelayo (Discret. Appl. Math., 2019)

Neighbor-locating colorings in graphs. - Liliana Alcón; Marisa Gutierrez; Carmen Hernando 001; Mercè Mora; Ignacio M. Pelayo (Theor. Comput. Sci., 2020)

Some product graphs with power dominating number at most 2. - Najibeh Shahbaznejad; Adel P. Kazemi; Ignacio M. Pelayo (AKCE Int. J. Graphs Comb., 2021)

Metric dimension on sparse graphs and its applications to zero forcing sets. - Nicolas Bousquet 001; Quentin Deschamps; Aline Parreau; Ignacio M. Pelayo (CoRR, 2021)

The neighbor-locating-chromatic number of trees and unicyclic graphs. - Liliana Alcón; Marisa Gutierrez; Carmen Hernando 001; Mercè Mora; Ignacio M. Pelayo (Discuss. Math. Graph Theory, 2023)

Reconstructing a graph from the boundary distance matrix. - José Cáceres; Ignacio M. Pelayo (Discuss. Math. Graph Theory, 2025)