|
05C05 |
Trees |
|
05C12 |
Distance
in graphs |
|
05C20 |
Digraphs,
tournaments |
|
05C35 |
Extremal
problems |
|
05C38 |
Paths
and cycles |
|
05C40 |
Connectivity |
|
05C50 |
Graphs
and matrices |
|
05C69 |
Dominating
sets, independent sets, cliques |
|
05C78 |
Graph
labelling |
Preprints and In-Progress
·
I. M. Pelayo.
Geodesic
Convexity and Cartesian Products in Graphs. MANUSCRIPT.
·
L. Alcón, M.
Gutiérrez, C. Hernando, M. Mora, I. M. Pelayo. The Neighbor-Locating-Chromatic
Number of Pseudotrees. Preprint.
·
I. G. Yero, C. Hernando, M. Mora, I. M. Pelayo, I. Peterin. Neighbor-locating-dominating
partitions in graphs. Preprint.
·
J. Cáceres,
C. Hernando, M. Mora, I. M. Pelayo, M. Strong geodetic and isometric
path numbers in graphs. Preprint.
·
I. M. Pelayo,
N. Shahbaznejad. Zero Forcing sets and Power
Dominating sets of cardinality at most 2. Submitted.
·
I. M. Pelayo.
Zero forcing Sets in Graphs: A Brief Survey. Preprint.
Refereed Publications
Ø Neighbor locating colorings in graphs. Theoret. Comput.
Sci.. 806 (2020) 144-155. [with L. Alcón, M.
Gutiérrez, C. Hernando, M. Mora].
Ø Resolving dominating partitions
in graphs. Discrete
Applied Mathematics. 266 (2019) 237-251. [with C.
Hernando, M. Mora].
Ø Locating domination in
bipartite graphs and their complements. Discrete
Applied Mathematics. 263 (2019) 195-203. [with C. Hernando, M. Mora].
Ø General bounds on limited broadcast
domination. Disc. Math & Theor. Comp. Sci. 20
(2) (2018) 131-136. [with J. Cáceres, C.
Hernando, M. Mora, M. L. Puertas].
Ø Neighbor-locating coloring: graph operations and extremal
cardinalities. Elect. Notes in Disc. Math. 68 (2018) 131-136. [with L. Alcón, M.
Gutiérrez, C. Hernando, M. Mora].
Ø Dominating 2-broadcast
in graphs: complexity, bounds and extremal graphs. Applicable Analysis and Discrete
Mathematics. 12 (2018) 205-223.
[with J. Cáceres, C.
Hernando, M. Mora, M. L. Puertas].
Ø On perfect and quasiperfect domination in graphs. Filomat. 31 (2) (2017) 413-423. [with J.
Cáceres, C. Hernando, M. Mora, M. L. Puertas].
Ø Perfect
and quasiperfect domination in trees. Applicable Analysis and Discrete Mathematics. 10 (1) (2016) 46-64. [with J. Cáceres, C.
Hernando, M. Mora, M. L. Puertas].
Ø Quasiperfect
domination in trees. Elect. Notes in Disc. Math. 50
(2015) 439-444. [with J. Cáceres, C.
Hernando, M. Mora, M. L. Puertas].
Ø On global location-domination
in graphs. Ars Math. Contemp. 8 (2015) 365–379. [with C. Hernando, M. Mora].
Ø Nordhaus-Gaddum
bounds for locating domination. European
Journal of Combinatorics. 36
(2014) 1-6. [with C. Hernando, M. Mora].
Ø Geodesic
Convexity in Graphs. Springer briefs in
Mathematics. 2013, 112pp, ISBN: 978-1-4614-8698-5.
Ø Locating dominating codes:
Bounds and Extremal cardinalities. Appl.
Mathematics and Computation. 220 (2013) 38-45. [J.
Cáceres, C. Hernando, M. Mora, M. L. Puertas].
Ø Some
structural, metric and convex properties on the boundary of a graph. Ars Combinatoria. 109
(2013) 267-283. [with C. Hernando, M. Mora, C. Seara].
Ø On the
metric dimension of infinite graphs. Discrete
Applied Mathematics. 160 (18) (2012) 2618-2626. [with J.
Cáceres, C. Hernando, M. Mora, M. L. Puertas].
Ø On
the geodetic and the hull numbers in strong product graphs. Computers & Mathematics with Apps. 60 (11) (2010) 3020-3031. [J.
Cáceres, C. Hernando, M. Mora, M. L. Puertas].
Ø The Longest
Path Transit Function of a Graph and Betweenness.
Utilitas
Mathematica. 82 (2010) 111-127. [with M. Changat, Prasanth G. Narasimha-Shenoi].
Ø Extremal graph theory for metric dimension and diameter.
The Electronic Journal of Combinatorics. 17 (1) R30 (2010).
[C.
Hernando, M. Mora, C. Seara, D. R. Wood].
Ø On the metric
dimension of infinite graphs. Elect. Notes in Disc. Math. 35 (2009) 15-20. [with J.
Cáceres, C. Hernando, M. Mora, M. L. Puertas].
Ø Generalizing the Krein-Milman
property in graph convexity spaces: a short survey. RMS Lecture Notes Series in Mathematics. 5 (2008) 131-142.
Ø Geodeticity of the contour of chordal graphs. Discrete Applied Mathematics. 156 (7) (2008) 1132-1142. [with J. Cáceres, C.
Hernando, M. Mora,
M. L. Puertas, C. Seara].
Ø
Extremal Graph theory for Metric Dimension and Diameter.
Elect. Notes in Disc. Math.. 29 (2007) 339-343. [with C. Hernando, M. Mora, C. Seara,
D.R. Wood].
Ø On the
metric dimension of cartesian products of graphs.
Siam J.
on Disc. Math.. 21 (2) (2007) 423-441. [with J. Cáceres, C. Hernando,
M. Mora, M.L.
Puertas, C. Seara, D.R.
Wood].
Ø
On the
connectivity of cages with girth five, six and eight. Discrete
Mathematics. 307 (11-12) (2007) 1441-1446. [with X.
Marcote, C. Balbuena].
Ø
Some
structural, metric and convex properties on the boundary of a graph. Elect. Notes in Disc. Math. 24 (2006) 203-209. [with C. Hernando, M. Mora, C. Seara].
Ø
On geodetic sets formed by boundary vertices. Discrete Mathematics 306 (2)
(2006) 188-198. [with J.
Cáceres, C. Hernando, M. Mora, M.L. Puertas, C. Seara].
Ø
On the metric dimension of some
families of graphs. Elect. Notes in Disc. Math. 22 (2005) 129-133. [with J.
Cáceres, C. Hernando, M. Mora, M.L. Puertas, C. Seara].
Ø
$(\delta,
g)$-cages with $g\ge10$ are 4-connected. Discrete Mathematics 301
(1) (2005) 124-136. [with X. Marcote, C. Balbuena, J. Fàbrega].
Ø
Searching for geodetic boundary vertex sets.
Elect. Notes in Disc. Math. 19 (2005) 25-31. [with J.
Cáceres, C. Hernando, M. Mora, M.L. Puertas, C. Seara].
Ø
On the Steiner,
hull and geodetic number of graphs. Discrete Mathematics 293
(1-3) (2005) 139-154. [with C.
Hernando, T. Jiang, M. Mora, C. Seara].
Ø Diameter,
short paths and superconnectivity in digraphs.
Discrete Mathematics 288
(1-3) (2004) 113-123. [with X. Marcote, C. Balbuena].
Ø Comment
on "The Steiner number of a graph" by G. Chartrand and P. Zhang:
[Discrete Mathematics 242 (2002) 41–54]. Discrete
Mathematics 280 (1-3) (2004) 259-263.
Ø
Algebraic properties of a digraph and its line digraph.
Journal of Interconnection Networks 4 (4) (2003) 377-393. [with C.
Balbuena, D. Ferrero, X. Marcote].
Ø Diameter
vulnerability of Generalized Compound Graphs. Discrete Applied Mathematics 130 (3) (2003) 417-436. [with J.
Gomez, C. Balbuena].
Ø
Using a progressive withdrawal procedure to study superconn. in l1-digraphs. Disc.
Mathematics 267
(1-3) (2003) 229-246. [with X.
Marcote, C. Balbuena, J. Fàbrega].
Ø
Every cubic cage is quasi 4-connected.
Discrete Mathematics 266 (1-3) (2003) 311-320. [with X.
Marcote, C. Balbuena].
Ø
On the superconnectivity of
generalized p-cycles. Discrete
Mathematics 255
(1-3) (2002) 13-23. [with C. Balbuena, J. Gomez].
Ø
Superconnected digraphs and graphs
with small conditional diameter. Networks
39 (3) (2002) 153-160. [with C.
Balbuena, J. Fàbrega, X. Marcote].
Ø
Every
Cubic Cage is quasi 4-connected. Electronic Notes in Discrete Mathematics 10 (2001). [with X.
Marcote, C. Balbuena].
Ø
On the connectivity of generalized p-cycles.
Ars Combinatoria
58 (2001) 215-231. [with C.
Balbuena, J. Gomez].
Ø
New large graphs with given degree and diameter six.
Networks 34 (2)
(1999) 154-161. [with J.
Gomez, C. Balbuena].
Congress contributions
Ø
Graphs with Power
Domination at most 2. 27th British Combinatorial Conference. Birmingham, England. 7/2019.
Ø Neighbor-locating colorings in pseudotrees. C&C2018. High Tatras,
Slovakia. 9/2018.
Ø
Neighbor-locating
coloring: graph operations and extremal cardinalities. DMD2018. Sevilla, Spain. 6/2018.
Ø
Neighbor Locating
Colorings in Graphs, CID 2017, Piechowice, Poland, 9/2017.
Ø Location-domination
in bipartite graphs, XEAMD, La Linea de la
Concepción, Spain, 7/2017.
Ø Coloración de
grafos por vecindades diferentes, XEAMD, La Linea de la
Concepción, Spain, 7/2017.
Ø
Limited broadcast
domination: upper bounds and complexity, XEAMD, La Linea de la Concepción, Spain, 7/2017.
Ø Extremal values in graphs for
metric-locating-dominating partitions, 2nd
MCGTC, Qawra, Malta, 7/2017.
Ø Locating-dominating partitions
in graphs, VII LAWCG, La Plata, Argentina, 11/2016.
Ø Limited broadcast domination, BGW2016, Bordeaux, France, 11/2016.
Ø Locating partitions in graphs, 7ECM, Berlin, Germany, 7/2016.
Ø General bounds on limited broadcast
domination, 4GWGT, Gdansk, Poland, 6/2016.
Ø Some relations between the partition
dimension and the twin number
of a graph,
8SICGT, Kranjska Gora, Slovenia, 6/2015.
Ø Quasiperfect dominations in trees, LAGOS 2015, Beberibe, Ceará, Brazil, 5/2015.
Ø LD-graphs and global location-domination in
bipartite graphs, IX JMDA, Tarragona, Spain, 7/2014.
Ø On perfect
and quasiperfect dominations
in graphs, IX JMDA, Tarragona, Spain, 7/2014.
Ø The graph distance game and some graph
operations, IX JMDA, Tarragona, Spain, 7/2014.
Ø Quasiperfect Dominating Codes in
Graphs. 9th International Colloquium on Graph
Theory ICGT '14, Grenoble, France, 7/2014.
Ø Location and
domination in graphs. EUROGIGA FINAL CONFERENCE. Berlin, Germany, 2/2014.
Ø Locating domination in graphs
and their complements, VIII EAMD,
Sevilla, Spain, 10/2013.
Ø Nuevas cotas para parámetros de
dominación y localización en grafos, VIII EAMD, Sevilla, Spain, 10/2013.
Ø Global locating domination in bipartite graphs, 24th British Combinatorial
Conference, Egham, England, 7/2013.
Ø Nordhaus-Gaddum-type results for
locating domination, CanaDAM’13, Saint John’s, Canada, 6/2013.
Ø Parámetros de localización y
dominación de un grafos y su complementario, VIII JMDA, Almeria, Spain, 7/2012.
Ø Watching systems
in complete bipartite graphs, VIII JMDA, Almeria, Spain, 7/2012.
Ø Locating dominating codes versus Locating-dominating codes, BWIC 2011, Bordeaux, France, 11/2011
Ø Dominating location in graphs, CanaDAM’11, Victoria, Canada, 6/2011.
Ø Geodetic and hull numbers in strong product graphs, CanaDAM’11, Victoria, Canada, 6/2011.
Ø Metric dimension in infinite
but locally finite graphs, CanaDAM’11, Victoria, Canada, 6/2011.
Ø Geodetic and hull numbers
of strong products of graphs, VII JMDA, Castro Urdiales, Spain, 7/2010.
Ø Boundary-type
sets and product operators in graphs, VII JMDA, Castro Urdiales, Spain, 7/2010.
Ø Valores extremos
en los parámetros de dominación
y resolución de un grafo,
VII JMDA, Castro Urdiales, Spain, 7/2010.
Ø Locating domination in
graphs. 8TH French Combinatorial Conference, Orsay, France, 6/2010.
Ø On
the metric dimension of infinite graphs, LAGOS 09, Gramado, Rio
Grande do Sul, Brazil, 11/2009.
Ø On locating and dominating sets in graphs, VI EAMD, Galaroza, Spain,
10/2009.
Ø Strong
product of graphs: geodetic and hull numbers and boundary-type sets, 22th British
Combinatorial Conference, St Andrews, Scotland, 7/2009.
Ø Metric
dimension for infinite graphs, 22th British
Combinatorial Conference, St Andrews, Scotland, 7/2009.
Ø Producto
fuerte de grafos: invariantes de convexidad y conjuntos fronterizos, VI JMDA, Lleida,
Spain, 7/2008.
Ø On the metric dimension
of infinite graphs, VI JMDA, Lleida,
Spain, 7/2008.
Ø Extremal graph theory for metric dimension and diameter, Eurocomb
2007, Sevilla, Spain,
9/2007.
Ø Dimensión métrica de grafos infinitos,
V EAMD, La Línea de la
Concepción, Spain, 7/2007.
Ø Some structural, metric
and convex properties on the boundary of a graph, Fifth Cracow Conference on Graph,
Ustron, Poland, 9/2006.
Ø On the metric
dimension of cartesian products of graphs, Quintas Jornadas de Matemática Discreta y Algorítmica, Soria, Spain,
7/2006.
Ø
Grafos de orden
máximo y mínimo con diámetro y dimensión
métrica fijados, Quintas Jornadas de
Matemática Discreta y Algorítmica, Soria, Spain,
7/2006.
Ø On the metric dimension of some products of
graphs, SIAM Conference on Discrete Mathematics,
Victoria, Canada, 6/2006.
Ø Independence and
domination in graph convexity spaces, INTERNATIONAL WORKSHOP ON METRIC
AND CONVEX GRAPH THEORY, Barcelona, Spain, 6/2006.
Ø Geodesic convexity in graphs [Lecture 1, Lecture 2, Lecture 3, Lecture 4], International Instructional Workshop on Convexity in Discrete
Structures, Trivandrum, Kerala, India, 3/2006.
Ø On
the metric dimension of some families of graphs, 7th
International Colloquium on Graph Theory ICGT '05, Hyeres,
France, 9/2005.
Ø On the metric
dimension of graph products, 20th British
Combinatorial Conference, Durham, England, 7/2005.
Ø On monophonic sets in graphs. 20th British Combinatorial Conference, Durham, England,
7/2005.
Ø El dígrafo
excéntrico de un grafo intervalo. XI Encuentros de Geometría Computacional, Santander, Spain,
6/2005.
Ø Reconstrucción
de un grafo a partir de la clausura geodética. XI Encuentros de
Geometría Computacional,
Santander, Spain, 6/2005.
Ø Searching
for geodetic boundary vertex sets. GRACO 2005: 2nd Brazilian Symposium on
Graphs, Algorithms and Combinatorics,
Angra dos Reis, Rio de Janeiro, Brazil, 4/2005.
Ø Conjuntos geodéticos
formados por vértices fronterizos de un grafo. "Cuartas Jornadas de Matemática Discreta y
Algorítmica",
Cercedilla, Spain, 9/2004.
Ø Estudio del contorno en grafos cordales. "Cuartas Jornadas de Matemática Discreta y
Algorítmica",
Cercedilla, Spain, 9/2004.
Ø Geodesic
convexity and chordal graphs. Graph Theory 2004: a conference in memory of Claude Berge,
Paris, France, 7/2004.
Ø On geodesic and monophonic convexity. 20th European Workshop on Computational Geometry, Sevilla, Spain, 3/2004.
Ø On monophonic sets in graphs. III Encuentro Andaluz de Matemáticas Discretas, Almeria, Spain, 9/2003.
Ø Graphs as convexity spaces: classical and graph theoretical
parameters. Combinatorics
in Oporto, Portugal, 9/2003.
Ø On the Steiner set problem in graphs. 19th British Combinatorial Conference, Bangor, England,
6/2003.
Ø Convexity
in graphs: Steiner sets, Hull sets and Geodetic sets. 2003 AMS Spring Central Section Meeting, Bloomington,
IN, USA, 4/2003.
Ø On
the connectivity of cages. Fourth Cracow
Conference on Graph Theory "Czorsztyn '02",
Czorsztyn, Poland, 9/2002.
Ø Attended the "Terceras Jornadas de Matemática
Discreta",
Mairena del Aljarafe, Sevilla, Spain, 9/2002.
Ø Every
cage is 4-connected. Combinatoric's 02, Maratea, Italy, 6/2002.[Table1][Table2][Table3]
Ø Every cubic cage
is quasi 4-connected. 18th British Combinatorial Conference, Falmer,
Brighton, England, 7/2001.
Ø Using a Progressive Withdrawal Algorithm to Study Superconnectivity in l1-digraphs. Combinatoric's 00, Gaeta,
Italy, 6/2000.
Ø Superconnected Digraphs and Graphs with Conditional Diameters. Combinatoric's 00,
Gaeta, Italy, 6/2000.
Ø The Jordan normal form of a line digraph.
17th British Combinatorial Conference, Canterbury, England, 7/1999.
Ø Using the parameter l to study the connectivity
of digraphs and graphs. 17th British Combinatorial Conference, Canterbury,
England, 7/1999.
Ø Extraconnectivity of digraphs. 17th British Combinatorial
Conference. Canterbury, England, 7/1999.
Ø Diameter vulnerability of generalized compound graphs.
17th British Combinatorial Conference. Canterbury, England, 7/1999.
Ø On the connectivity of generalized p-cycles.
Combinatoric's 98, Palermo, Italy, 6/1998.
Ø New large graphs with diameter six.
Combinatoric's 98, Palermo, Italy, 6/1998.
top
| preprints |
papers | conferences | Home