Ignacio M. Pelayo

According to our database1, Ignacio M. Pelayo authored at least 33 papers between 1999 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Neighbor-locating colorings in graphs.
Theor. Comput. Sci., 2020

2019
Resolving dominating partitions in graphs.
Discret. Appl. Math., 2019

Locating domination in bipartite graphs and their complements.
Discret. Appl. Math., 2019

2018
Neighbor-locating coloring: graph operations and extremal cardinalities.
Electron. Notes Discret. Math., 2018

General bounds on limited broadcast domination.
Discret. Math. Theor. Comput. Sci., 2018

2015
Quasiperfect Domination in Trees.
Electron. Notes Discret. Math., 2015

On global location-domination in graphs.
Ars Math. Contemp., 2015

2014
LD-graphs and global location-domination in bipartite graphs.
Electron. Notes Discret. Math., 2014

The graph distance game and some graph operations.
Electron. Notes Discret. Math., 2014

Nordhaus-Gaddum bounds for locating domination.
Eur. J. Comb., 2014

2013
Locating-dominating codes: Bounds and extremal cardinalities.
Appl. Math. Comput., 2013

2010
On the geodetic and the hull numbers in strong product graphs.
Comput. Math. Appl., 2010

2009
On the Metric Dimension of Infinite Graphs.
Electron. Notes Discret. Math., 2009

2008
Geodeticity of the contour of chordal graphs.
Discret. Appl. Math., 2008

2007
On the Metric Dimension of Cartesian Products of Graphs.
SIAM J. Discret. Math., 2007

Extremal Graph Theory for Metric Dimension and Diameter.
Electron. Notes Discret. Math., 2007

On the connectivity of cages with girth five, six and eight.
Discret. Math., 2007

2006
Some structural, metric and convex properties on the boundary of a graph.
Electron. Notes Discret. Math., 2006

On geodetic sets formed by boundary vertices.
Discret. Math., 2006

2005
On the metric dimension of some families of graphs.
Electron. Notes Discret. Math., 2005

Searching for geodetic boundary vertex sets.
Electron. Notes Discret. Math., 2005

(<i>delta</i>, <i>g</i>)-cages with <i>g</i> geq 10 are 4-connected.
Discret. Math., 2005

On the Steiner, geodetic and hull numbers of graphs.
Discret. Math., 2005

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

Diameter, short paths and superconnectivity in digraphs.
Discret. Math., 2004

2003
Algebraic properties of a digraph and its line digraph.
J. Interconnect. Networks, 2003

Using a progressive withdrawal procedure to study superconnectivity in digraphs.
Discret. Math., 2003

Diameter vulnerability of GC graphs.
Discret. Appl. Math., 2003

2002
Superconnected digraphs and graphs with small conditional diameters.
Networks, 2002

On the superconnectivity of generalized <i>p</i>-cycles.
Discret. Math., 2002

2001
Every Cubic Cage is quasi 4-connected.
Electron. Notes Discret. Math., 2001

On the connectivity of generalized p-cycles.
Ars Comb., 2001

1999
New large graphs with given degree and diameter six.
Networks, 1999


  Loading...