María Luz Puertas

Orcid: 0000-0002-9093-5461

According to our database1, María Luz Puertas authored at least 36 papers between 2005 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Elimination properties for minimal dominating sets of graphs.
Discuss. Math. Graph Theory, 2023

On the metric dimensions for sets of vertices.
Discuss. Math. Graph Theory, 2023

2022
The 2-domination number of cylindrical graphs.
Comput. Appl. Math., December, 2022

HPC acceleration of large (min, +) matrix products to compute domination-type parameters in graphs.
J. Supercomput., 2022

On the 2-domination Number of Cylinders with Small Cycles.
Fundam. Informaticae, 2022

2021
Powers of Large Matrices on GPU Platforms to Compute the Roman Domination Number of Cylindrical Graphs.
IEEE Access, 2021

2019
Robust observer design by sign-stability for the monitoring of population systems.
J. Frankl. Inst., 2019

On Stronger Types of Locating-dominating Codes.
Discret. Math. Theor. Comput. Sci., 2019

Every grid has an independent [1, 2]-set.
Discret. Appl. Math., 2019

2018
Efficient Location of Resources in Cylindrical Networks.
Symmetry, 2018

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

On independent [1, 2]-sets in trees.
Discuss. Math. Graph Theory, 2018

Strong resolving graphs: The realization and the characterization problems.
Discret. Appl. Math., 2018

Shortcut sets for the locus of plane Euclidean networks.
Appl. Math. Comput., 2018

2016
Shortcut sets for plane Euclidean networks (Extended abstract).
Electron. Notes Discret. Math., 2016

Independent [1, 2]-domination of grids via min-plus algebra.
Electron. Notes Discret. Math., 2016

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

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

2013
Graph operations and Lie algebras.
Int. J. Comput. Math., 2013

Resolving sets for Johnson and Kneser graphs.
Eur. J. Comb., 2013

The determining number of Kneser graphs.
Discret. Math. Theor. Comput. Sci., 2013

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

2012
Combinatorial structures of three vertices and Lie algebras.
Int. J. Comput. Math., 2012

Minimal trees and monophonic convexity.
Discuss. Math. Graph Theory, 2012

On the metric dimension of infinite graphs.
Discret. Appl. Math., 2012

2011
Towards a new framework for domination.
Comput. Math. Appl., 2011

2010
On the Determining Number and the Metric Dimension of Graphs.
Electron. J. Comb., 2010

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

2008
Steiner distance and convexity in graphs.
Eur. J. Comb., 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

Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs.
Discret. Math., 2007

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

Rebuilding convex sets in graphs.
Discret. Math., 2005


  Loading...