Juan A. Rodríguez-Velázquez

Orcid: 0000-0002-9082-7647

Affiliations:
  • University of Cádiz, Department of Mathematics


According to our database1, Juan A. Rodríguez-Velázquez authored at least 75 papers between 2006 and 2022.

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

2022
Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs.
Fundam. Informaticae, 2022

Total protection of lexicographic product graphs.
Discuss. Math. Graph Theory, 2022

Protection of lexicographic product graphs.
Discuss. Math. Graph Theory, 2022

From Italian domination in lexicographic product graphs to w-domination in graphs.
Ars Math. Contemp., 2022

The adjacency dimension of graphs.
Ars Math. Contemp., 2022

2021
Correction: Cabrera Martínez et al. On the Secure Total Domination Number of Graphs. Symmetry 2019, 11, 1165.
Symmetry, 2021

From the Quasi-Total Strong Differential to Quasi-Total Italian Domination in Graphs.
Symmetry, 2021

Secure domination in rooted product graphs.
J. Comb. Optim., 2021

Secure Italian domination in graphs.
J. Comb. Optim., 2021

A note on double domination in graphs.
Discret. Appl. Math., 2021

From (secure) w-domination in graphs to protection of lexicographic product graphs.
CoRR, 2021

On The (k, t)-Metric Dimension Of Graphs.
Comput. J., 2021

Closed formulas for the total Roman domination number of lexicographic product graphs.
Ars Math. Contemp., 2021

2020
Total Domination in Rooted Product Graphs.
Symmetry, 2020

Secure w-Domination in Graphs.
Symmetry, 2020

Double domination in lexicographic product graphs.
Discret. Appl. Math., 2020

2019
On the Secure Total Domination Number of Graphs.
Symmetry, 2019

Total Weak Roman Domination in Graphs.
Symmetry, 2019

On the weak Roman domination number of lexicographic product graphs.
Discret. Appl. Math., 2019

On the General Randić index of polymeric networks modelled by generalized Sierpiński graphs.
Discret. Appl. Math., 2019

On the super domination number of lexicographic product graphs.
Discret. Appl. Math., 2019

On the <i>k</i>-metric dimension of metric spaces.
Ars Math. Contemp., 2019

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

On the (adjacency) metric dimension of corona and strong product graphs and their local variants: Combinatorial and computational results.
Discret. Appl. Math., 2018

2017
The Simultaneous Local Metric Dimension of Graph Families.
Symmetry, 2017

Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph.
Fundam. Informaticae, 2017

Computing the metric dimension of a graph from primary subgraphs.
Discuss. Math. Graph Theory, 2017

On generalized Sierpi?ski graphs.
Discuss. Math. Graph Theory, 2017

The strong metric dimension of generalized Sierpiński graphs with pendant vertices.
Ars Math. Contemp., 2017

Computing the k-metric dimension of graphs.
Appl. Math. Comput., 2017

2016
Strong metric dimension of rooted product graphs.
Int. J. Comput. Math., 2016

The Simultaneous Metric Dimension of Families Composed by Lexicographic Product Graphs.
Graphs Comb., 2016

Relationships Between the 2-Metric Dimension and the 2-Adjacency Dimension in the Lexicographic Product of Graphs.
Graphs Comb., 2016

The Local Metric Dimension of Strong Product Graphs.
Graphs Comb., 2016

Closed formulae for the strong metric dimension of lexicographic product graphs.
Discuss. Math. Graph Theory, 2016

Weak total resolvability in graphs.
Discuss. Math. Graph Theory, 2016

The k-metric dimension of the lexicographic product of graphs.
Discret. Math., 2016

The simultaneous metric dimension of graph families.
Discret. Appl. Math., 2016

The partition dimension of corona product graphs.
Ars Comb., 2016

2015
Computing the local metric dimension of a graph from the local metric dimension of primary subgraphs.
Int. J. Comput. Math., 2015

On the Strong Metric Dimension of Cartesian Sum Graphs.
Fundam. Informaticae, 2015

2014
Preface.
Electron. Notes Discret. Math., 2014

Simultaneous Resolvability in Graph Families.
Electron. Notes Discret. Math., 2014

On the strong metric dimension of product graphs.
Electron. Notes Discret. Math., 2014

k-metric resolvability in graphs.
Electron. Notes Discret. Math., 2014

Closed formulae for the local metric dimension of corona product graphs.
Electron. Notes Discret. Math., 2014

A survey on alliances and related parameters in graphs.
Electron. J. Graph Theory Appl., 2014

On the strong metric dimension of Cartesian and direct products of graphs.
Discret. Math., 2014

On the partition dimension of trees.
Discret. Appl. Math., 2014

The Hosoya polynomial of distance-regular graphs.
Discret. Appl. Math., 2014

Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results.
Proceedings of the Computer Science - Theory and Applications, 2014

2013
Alliance free sets in Cartesian product graphs.
Discret. Appl. Math., 2013

Computing global offensive alliances in Cartesian product graphs.
Discret. Appl. Math., 2013

On the strong metric dimension of corona product graphs and join graphs.
Discret. Appl. Math., 2013

Boundary powerful k-alliances in graphs.
Ars Comb., 2013

2012
Nordhaus-Gaddum results for the convex domination number of a graph.
Period. Math. Hung., 2012

Partitioning a Graph into Global Powerful k-Alliances.
Graphs Comb., 2012

2011
Partitioning a graph into offensive k-alliances.
Discret. Appl. Math., 2011

On the metric dimension of corona product graphs.
Comput. Math. Appl., 2011

2010
Boundary defensive k-alliances in graphs.
Discret. Appl. Math., 2010

On geodetic and k-geodetic sets in graphs.
Ars Comb., 2010

On global offensive k-alliances in graphs.
Appl. Math. Lett., 2010

A note on the partition dimension of Cartesian product graphs.
Appl. Math. Comput., 2010

On the Partition Dimension of Cartesian Product Graphs.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

2009
On the global offensive alliance number of a graph.
Discret. Appl. Math., 2009

Global defensive k-alliances in graphs.
Discret. Appl. Math., 2009

Offensive r-alliances in graphs.
Discret. Appl. Math., 2009

On reliability indices of communication networks.
Comput. Math. Appl., 2009

Defensive k-alliances in graphs.
Appl. Math. Lett., 2009

On the Decomposition of Graphs into Offensive k-Alliances.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
Global <i>r</i>-alliances and total domination.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

2007
Spectral study of alliances in graphs.
Discuss. Math. Graph Theory, 2007

On the defensive <i>k</i>-alliance number of a graph.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

2006
Global offensive alliances in graphs.
Electron. Notes Discret. Math., 2006

On defensive alliances and line graphs.
Appl. Math. Lett., 2006


  Loading...